The Time-Conditioned Approach in Dynamic Programming Search for LVCSR

by Stefan Ortmanns , Hermann Ney

Datum	Value	Source
TITLE	The Time-Conditioned Approach in Dynamic Programming Search for LVCSR	SVM HeaderParse 0.2
AUTHOR NAME	Stefan Ortmanns	SVM HeaderParse 0.2
AUTHOR NAME	Hermann Ney	SVM HeaderParse 0.2
ABSTRACT	Abstract—This paper presents the time-conditioned approach in dynamic programming search for large-vocabulary continuousspeech recognition. The following topics are presented: the baseline algorithm, a time-synchronous beam search version, a comparison with the word-conditioned approach, a comparison with stack decoding. The approach has been successfully tested on the NAB task using a vocabulary of 64 000 words. Index Terms—Beam search, dynamic programming, large vocabulary speech recognition, one-pass DP search, search organization, time-conditioned DP search. I.	SVM HeaderParse 0.2
CITATIONS	28 found	ParsCit 1.0