DocumentCode :
2833841
Title :
Improved Viterbi algorithm in continuous speech recognition
Author :
Liu, Wei ; Han, Weisheng
Author_Institution :
Sch. of Electron. Inf. Eng., Henan Univ. of Sci. & Technol., Luoyang, China
Volume :
7
fYear :
2010
fDate :
22-24 Oct. 2010
Abstract :
It is key technique to improve the recognition efficiency while not affecting the recognition accuracy in the speech recognition systems. The method combining Viterbi algorithm with Beam pruning technique is useful to compress the search space, which reduces the computational complexity. However, Viterbi-Beam algorithm is a kind of suboptimal algorithm. The selecting of the pruning threshold will affect the system recognition accuracy. In this paper, we propose an adaptive Viterbi-Beam search algorithm by analyzing the voice activity model of different stages. This method leads to an improvement on search efficiency of 35.77%, without the recognition accuracy reduction.
Keywords :
computational complexity; dynamic programming; search problems; speech recognition; Viterbi algorithm; beam pruning technique; computational complexity; continuous speech recognition; search space; suboptimal algorithm; Artificial neural networks; Speech; Speech recognition; Viterbi algorithm; Viterbi-Beam algorithm; hidden Markov model; pruning threshold; speech recognition;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Computer Application and System Modeling (ICCASM), 2010 International Conference on
Conference_Location :
Taiyuan
Print_ISBN :
978-1-4244-7235-2
Electronic_ISBN :
978-1-4244-7237-6
Type :
conf
DOI :
10.1109/ICCASM.2010.5620406
Filename :
5620406
Link To Document :
بازگشت