DocumentCode
1931124
Title
A*-admissible heuristics for rapid lexical access
Author
Kenny, P. ; Hollan, R. ; Gupta, V. ; Lennig, M. ; Mermelstein, P. ; O´Shaughnessy, D.
Author_Institution
INRS-Telecommun., Montreal, Que., Canada
fYear
1991
fDate
14-17 Apr 1991
Firstpage
689
Abstract
The authors present a new class of A* algorithms for Viterbi phonetic decoding subject to lexical constraints. They show that this type of algorithm can be made to run substantially faster than the Viterbi algorithm in an isolated word recognizer having a vocabulary of 1600 words and that it runs very quickly on a 60000-word recognition task. In addition, multiple recognition hypotheses can be generated on demand and the search can be constrained to respect conditions on phone durations in such a way that computational requirements are substantially reduced
Keywords
decoding; speech analysis and processing; speech recognition; A* admissible heuristics; A* algorithms; Viterbi phonetic decoding; isolated word recognizer; lexical access; lexical constraints; multiple recognition hypotheses; phone durations; search; vocabulary; Art; Councils; Hidden Markov models; Probability distribution; Sampling methods; Tree graphs; Viterbi algorithm; Yttrium;
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.150433
Filename
150433
Link To Document