Title :
A N-best sentence hypotheses enumeration algorithm with duration constraints based on the two level algorithm
Author :
Marzal, Andrés ; Vidal, Enrique
Author_Institution :
Dept. de Sistemas Inf. y Comput., Univ. Politecnica de Valencia, Spain
fDate :
30 Aug-3 Sep 1992
Abstract :
A new N-best sentence hypotheses enumeration algorithm for continuous speech recognition that correctly incorporates duration constraints and which is very efficient in practice is presented. Based on the most general two-level procedure, this algorithm provides greater flexibility in acoustic modeling than previous approaches and is very well suited for large vocabulary applications
Keywords :
computational complexity; dynamic programming; speech recognition; N-best sentence hypotheses enumeration algorithm; computational complexity; continuous speech recognition; duration constraints; dynamic programming; two level algorithm; Acoustic distortion; Automatic speech recognition; Decoding; Dictionaries; Dynamic programming; Filters; Shortest path problem; Viterbi algorithm;
Conference_Titel :
Pattern Recognition, 1992. Vol.III. Conference C: Image, Speech and Signal Analysis, Proceedings., 11th IAPR International Conference on
Conference_Location :
The Hague
Print_ISBN :
0-8186-2920-7
DOI :
10.1109/ICPR.1992.202063
