Recognition Time Reduction Technique for the Time-synchronous Viterbi Beam Search

시간 동기 비터비 빔 탐색을 위한 인식 시간 감축법

  • 이강성 (광운대학교 컴퓨터공학과)
  • Published : 2001.08.01

Abstract

This paper proposes a new recognition time reduction algorithm Score-Cache technique, which is applicable to the HMM-base speech recognition system. Score-Cache is a very unique technique that has no other performance degradation and still reduces a lot of search time. Other search reduction techniques have trade-offs with the recognition rate. This technique can be applied to the continuous speech recognition system as well as the isolated word speech recognition system. W9 can get high degree of recognition time reduction by only replacing the score calculating function, not changing my architecture of the system. This technique also can be used with other recognition time reduction algorithms which give more time reduction. We could get 54% of time reduction at best.

References

  1. Proc. ICASSP' 92 Improvments in beam search for 10000-word continuous speech recognition H. Ney(et al.)
  2. Proceedings of ICASSP' 91 The Forward-Backward Search Algorith Steve Austin(et al.)
  3. Doctorial Thesis Fast Speaker Independent Large Vocabulary Continuous Speech Recognition Monika Woszczyna
  4. 한국음향학회 하계학술발표대회 논문집 v.19 no.1(s) 1500 단어 실시간 화자 독립 음성인식 시스템 이강성
  5. Introduction to Statistical Pattern Recognition Keinosuke Fukunaga
  6. Proceedings of Eurospeech-97 Automatic Architecture Design by Likelihood-Base Context Clustering With Cross Validation lvica Rogina