DocumentCode
2262050
Title
Improvement in N-best search for continuous speech recognition
Author
Illina, Irina ; Gong, Yifan
Author_Institution
INRIA-Lorraine, Vandoeuvre-les-Nancy, France
Volume
4
fYear
1996
fDate
3-6 Oct 1996
Firstpage
2147
Abstract
Several techniques for reducing the search complexity of team search for continuous speech recognition task are proposed. Six heuristic methods for pruning are described and the parameters of the pruning am adjusted to keep constant the word error rate while reducing the computational complexity and memory demand. The evaluation of the effect of each pruning method is performed in the mixture stochastic trajectory model (MSTM). MSTM is a segment-based model using phonemes as the speech units. The set of tests in a speaker-dependent continuous speech recognition task shows that using the pruning methods, a substantial reduction of 67% of search effort is obtained in term of number of hypothesised phonemes during the search. All proposed techniques are independent of the acoustic models and therefore are applicable to other acoustic modeling techniques
Keywords
computational complexity; search problems; speech recognition; stochastic processes; N-best search; acoustic models; computational complexity; continuous speech recognition; heuristic methods; hypothesised phonemes; memory demand; mixture stochastic trajectory model; phonemes; pruning; pruning methods; search complexity reduction; segment-based model; speaker-dependent continuous speech recognition task; speech units; team search; word error rate; Acoustic beams; Acoustic measurements; Acoustic testing; Computational complexity; Decoding; Error analysis; Random access memory; Speech recognition; Stochastic processes; Viterbi algorithm;
fLanguage
English
Publisher
ieee
Conference_Titel
Spoken Language, 1996. ICSLP 96. Proceedings., Fourth International Conference on
Conference_Location
Philadelphia, PA
Print_ISBN
0-7803-3555-4
Type
conf
DOI
10.1109/ICSLP.1996.607228
Filename
607228
Link To Document