DocumentCode
284695
Title
A fast match for continuous speech recognition using allophonic models
Author
Bahl, L.R. ; de Souza, P.V. ; Gopalakrishnan, P.S. ; Nahamoo, D. ; Picheny, M.A.
Author_Institution
IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA
Volume
1
fYear
1992
fDate
23-26 Mar 1992
Firstpage
17
Abstract
In a large vocabulary real-time speech recognition system, there is a need for a fast method for selecting a list of candidate words from the vocabulary that match well with a given acoustic input. The authors describe a highly accurate fast acoustic match for continuous speech recognition. The algorithm uses allophonic models and efficient search techniques to select a set of candidate words. The allophonic models are derived by constructing decision trees that query the context in which each phone occurs to arrive at an allophone in a given context. The models for all the words in the vocabulary are arranged in a tree structure and efficient tree search algorithms are used to select a list of candidate words using these models. Using this method, the authors are able to obtain over 99% accuracy in the fast match for a continuous speech recognition task which has a vocabulary of 5000 words
Keywords
search problems; speech recognition; allophonic models; candidate words; continuous speech recognition; decision trees; efficient search techniques; fast acoustic match; large vocabulary; tree search algorithms; Acoustics; Context modeling; Decision trees; Hardware; Hidden Markov models; Probability distribution; Search methods; Speech enhancement; Speech recognition; Vocabulary;
fLanguage
English
Publisher
ieee
Conference_Titel
Acoustics, Speech, and Signal Processing, 1992. ICASSP-92., 1992 IEEE International Conference on
Conference_Location
San Francisco, CA
ISSN
1520-6149
Print_ISBN
0-7803-0532-9
Type
conf
DOI
10.1109/ICASSP.1992.225983
Filename
225983
Link To Document