Algorithms for an optimal A* search and linearizing the search in the stack decoder
- 1 January 1991
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 15206149,p. 693-696 vol. 1
- https://doi.org/10.1109/icassp.1991.150434
Abstract
Two algorithms are presented for accelerating the operation of a stack decoder. The first is a method for computing the true least upper bound so that an optimal admissible A* search can be performed. The second is a set of methods for linearizing the computation required by a stack decoder. The A* search has been implemented in a continuous speech recognizer simulator and has demonstrated a significant speedup. The linearizing algorithm has been partially implemented in the simulator and has also shown significant computational savings.Keywords
This publication has 5 references indexed in Scilit:
- Matrix fast match: a fast method for identifying a short list of candidate words for decodingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Hidden Markov models: a guided tourPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- A CSR-NL interface specification version 1.5Published by Association for Computational Linguistics (ACL) ,1989
- A Maximum Likelihood Approach to Continuous Speech RecognitionPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1983
- Fast Sequential Decoding Algorithm Using a StackIBM Journal of Research and Development, 1969