DocumentCode
1931350
Title
Algorithms for an optimal A* search and linearizing the search in the stack decoder
Author
Paul, Douglas B.
Author_Institution
Lincoln Lab., MIT, Lexington, MA, USA
fYear
1991
fDate
14-17 Apr 1991
Firstpage
693
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
decoding; digital simulation; optimisation; search problems; speech recognition; continuous speech recognizer simulator; linearizing algorithm; optimal admissible A* search; stack decoder; Costs; Decoding; Hidden Markov models; Natural languages; Search problems; Silicon compounds; Speech recognition; Stochastic processes; Stochastic systems; Upper bound;
fLanguage
English
Publisher
ieee
Conference_Titel
Acoustics, Speech, and Signal Processing, 1991. ICASSP-91., 1991 International Conference on
Conference_Location
Toronto, Ont.
ISSN
1520-6149
Print_ISBN
0-7803-0003-3
Type
conf
DOI
10.1109/ICASSP.1991.150434
Filename
150434
Link To Document