Algorithms for an optimal A* search and linearizing the search in the stack decoder

Authors:
D. B. Paul
Affiliations:
Lincoln Lab., MIT, Lexington, MA, USA
Venue:
ICASSP '91 Proceedings of the Acoustics, Speech, and Signal Processing, 1991. ICASSP-91., 1991 International Conference
Year:
1991

Citing 0
Cited 5

Phoneme Lattice Based A* Search Algorithm for Speech Recognition

TSD '02 Proceedings of the 5th International Conference on Text, Speech and Dialogue
The application of hidden Markov models in speech recognition

Foundations and Trends in Signal Processing
An efficient A* stack decoder algorithm for continuous speech recognition with a stochastic language model

ICASSP'92 Proceedings of the 1992 IEEE international conference on Acoustics, speech and signal processing - Volume 1
The Lincoln large-vocabulary stack-decoder HMM CSR

ICASSP'93 Proceedings of the 1993 IEEE international conference on Acoustics, speech, and signal processing: speech processing - Volume II
Acoustic modeling problem for automatic speech recognition system: conventional methods (Part I)

International Journal of Speech Technology

Quantified Score

Hi-index	0.00

Visualization

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.