New graph search techniques for speech recognition

We present a new multi-pass approach to the search problem in speech recognition. It builds on the 1-phone lookahead property which enables all of the time alignment for the first forward pass to be performed in pre-processing stage. This feature allows us to view the first forward pass a classical graph search problem and to apply powerful searching techniques that have not previously been used in speech recognition.<<ETX>>

[1]  Douglas D. O'Shaughnessy,et al.  A*-admissible heuristics for rapid lexical access , 1993, IEEE Trans. Speech Audio Process..

[2]  Nils J. Nilsson,et al.  Principles of Artificial Intelligence , 1980, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[3]  Douglas D. O'Shaughnessy,et al.  A new fast match for very large vocabulary continuous speech recognition , 1993, 1993 IEEE International Conference on Acoustics, Speech, and Signal Processing.

[4]  Hermann Ney,et al.  Word graphs: an efficient interface between continuous-speech recognition and language understanding , 1993, 1993 IEEE International Conference on Acoustics, Speech, and Signal Processing.

[5]  Douglas D. O'Shaughnessy,et al.  A very fast method for scoring phonetic transcriptions , 1993, EUROSPEECH.