The Time-Conditioned Approach in Dynamic Programming Search for LVCSR
BibTeX
@MISC{Ortmanns_thetime-conditioned,
author = {Stefan Ortmanns and Hermann Ney},
title = {The Time-Conditioned Approach in Dynamic Programming Search for LVCSR},
year = {}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
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.
