Skip to main content

Heuristic Search Methods for a Segment Based Continuous Speech Recognizer

  • Conference paper
Speech Recognition and Coding

Part of the book series: NATO ASI Series ((NATO ASI F,volume 147))

  • 231 Accesses

Abstract

In a continuous speech recognizer, the recognition problem is usually modelled as a search for the best path in a network of transitions between states. A full search can be very expensive in terms of computation and storage requirements. By adopting a segment based rather than a frame based approach,one can already obtain a severe reduction of mese requirements, but this may not be sufficient to allow for real time recognition. For our segment based Neural Network / Dynamic Programming hybrid [1], we have therefore introduced a heuristic search method. It is shown that this search is significantly faster than a Viterbi beam search, while there is no degradation of the recognition results.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  • [1] J.P. Martens, A. Vorstermans, N. Cremelie (1993), “A new Dynamic Programming / Multi-Layer Perceptron Hybrid for continuous speech recognition”, in Proceedings of EUROSPEECH-93, Berlin.

    Google Scholar 

  • [2] N J. Nilsson (1980), Principles of Artificial Intelligence, Palo Alto, California: Tioga.

    MATH  Google Scholar 

  • [3] H. Ney (1992), “A comparative Study of Two Search Strategies for Connected Word Recognition: Dynamic Programming and Heuristic Search”, in IEEE Transactions on Pattern Analysis and Machine Intelligence, Vol. 14, No. 5, May 1992.

    Google Scholar 

  • [4] D.B. Paul (1992), “An Efficient A* Stack Decoder Algorithm for Continuous Speech Recognition with a Stochastic Language Model,” in Proceedings of ICASSP-92, San Francisco.

    Google Scholar 

  • [5] S. Austin, R. Schwartz and P. Placeway (1991), “The Forward-Backward Search Algorithm,” in Proceedings of ICASSP-91 Toronto.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Cremelie, N., Martens, JP. (1995). Heuristic Search Methods for a Segment Based Continuous Speech Recognizer. In: Ayuso, A.J.R., Soler, J.M.L. (eds) Speech Recognition and Coding. NATO ASI Series, vol 147. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-57745-1_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-57745-1_6

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-63344-7

  • Online ISBN: 978-3-642-57745-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics