Fast Match Techniques

Real-time speech recognition systems often make use of a fast approximate match to quickly prune the search space to a manageable size. In this chapter we discuss several issues in connection with such fast match techniques.

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

[2]  Lalit R. Bahl,et al.  A fast admissible method for identifying a short list of candidate words , 1992 .

[3]  Douglas B. Paul.  The Lincoln Large-Vocabulary Stack-Decoder Based HMM CSR , 1994, HLT.

[4]  Mei-Yuh Hwang,et al.  An improved search algorithm using incremental knowledge for continuous speech recognition , 1993, 1993 IEEE International Conference on Acoustics, Speech, and Signal Processing.

[5]  Pietro Laface,et al.  Lexical access to large vocabularies for speech recognition , 1989, IEEE Trans. Acoust. Speech Signal Process..

[6]  P. Mermelstein,et al.  Fast search strategy in a large vocabulary word recognizer , 1988 .

[7]  Lalit R. Bahl,et al.  A fast approximate acoustic match for large vocabulary speech recognition , 1989, IEEE Trans. Speech Audio Process..

[8]  Robert Roth,et al.  A Rapid Match Algorithm for Continuous Speech Recognition , 1990, HLT.

[9]  Mitch Weintraub,et al.  Progressive-Search Algorithms For Large-Vocabulary Speech Recognition , 1993, HLT.

[10]  Richard M. Schwartz,et al.  Search Algorithms for Software-Only Real-Time Recognition with Very Large Vocabularies , 1993, HLT.

[11]  Lalit R. Bahl,et al.  A Maximum Likelihood Approach to Continuous Speech Recognition , 1983, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[12]  Donald Ervin Knuth,et al.  The Art of Computer Programming , 1968 .