DocumentCode :
2979467
Title :
Progress in dynamic programming search for LVCSR
Author :
Ney, Hermann ; Ortmanns, Stefan
Author_Institution :
Dept. of Comput. Sci., Tech. Hochschule Aachen, Germany
fYear :
1997
fDate :
14-17 Dec 1997
Firstpage :
287
Lastpage :
294
Abstract :
This paper gives an overview of recent improvements in dynamic programming search methods for large-vocabulary continuous speech recognition (LVCSR): searching using lexical trees, time-conditioned searching and word graph construction
Keywords :
dynamic programming; search problems; speech recognition; vocabulary; dynamic programming search methods; large-vocabulary continuous speech recognition; lexical trees; time-conditioned searching; word graph construction; Acoustic emission; Computer science; Context modeling; Dynamic programming; Explosions; Hidden Markov models; Search problems; Speech recognition; Tree graphs; Vocabulary;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Automatic Speech Recognition and Understanding, 1997. Proceedings., 1997 IEEE Workshop on
Conference_Location :
Santa Barbara, CA
Print_ISBN :
0-7803-3698-4
Type :
conf
DOI :
10.1109/ASRU.1997.659020
Filename :
659020
Link To Document :
بازگشت