A*-admissible heuristics for rapid lexical access

Authors:
P. Kenny;R. Hollan;V. Gupta;M. Lennig;P. Mermelstein;D. O'Shaughnessy
Affiliations:
INRS-Telecommun., Montreal, Que., Canada;INRS-Telecommun., Montreal, Que., Canada;INRS-Telecommun., Montreal, Que., Canada;INRS-Telecommun., Montreal, Que., Canada;INRS-Telecommun., Montreal, Que., Canada;INRS-Telecommun., Montreal, Que., Canada
Venue:
ICASSP '91 Proceedings of the Acoustics, Speech, and Signal Processing, 1991. ICASSP-91., 1991 International Conference
Year:
1991

Citing 0
Cited 2

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
Hybrid segmental-LVQ/HMM for large vocabulary speech recognition

ICASSP'92 Proceedings of the 1992 IEEE international conference on Acoustics, speech and signal processing - Volume 1

Quantified Score

Hi-index	0.00

Visualization

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.