Efficient viterbi beam search algorithm using dynamic pruning
Lingyun Xie, Limin Du · 2005
The efficiency of search algorithm is the key problem of large vocabulary continuous speech recognition (LVCSR) systems. This paper explores this issue and presents a dynamic pruning method based on Viterbi beam search algorithm. At each time frame, the proposed method can adjust the beam widths based on the current situation of search process. The experimental results show that it can reduce the computation complexity without degrading the recognition rate much. It is advantageous for implementations on real-time systems.