New results with the Lincoln tied-mixture HMM CSR system
HLT '91 Proceedings of the workshop on Speech and Natural Language
A rapid match algorithm for continuous speech recognition
HLT '90 Proceedings of the workshop on Speech and Natural Language
Algorithms for an optimal A search and linearizing the search in the stack decoder
HLT '90 Proceedings of the workshop on Speech and Natural Language
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
A CSR-NL interface specification version 1.5
HLT '89 Proceedings of the workshop on Speech and Natural Language
Problem-Solving Methods in Artificial Intelligence
Problem-Solving Methods in Artificial Intelligence
A stack decoder approach to approximate string matching
Proceedings of the 33rd international ACM SIGIR conference on Research and development in information retrieval
| Hi-index | 0.00 |
The stack decoder is an attractive algorithm for controlling the acoustic and language model matching in a continuous speech recognizer. A previous paper described a near-optimal admissible Viterbi A* search algorithm for use with noncross-word acoustic models and no-grammar language models [16]. This paper extends this algorithm to include unigram language models and describes a modified version of the algorithm which includes the full (forward) decoder, cross-word acoustic models and longer-span language models. The resultant algorithm is not admissible, but has been demonstrated to have a low probability of search error and to be very efficient.