Jihyuck Joa, Han‐Gyu Kimb, In‐Cheol Parka, Bang Chul Jungc, Hoyoung Yooc
Intelligent Automation & Soft Computing, Vol.25, No.2, pp. 351-358, 2019, DOI:10.31209/2019.100000096
Abstract A modified Viterbi scoring procedure is presented in this paper based on
Dijkstra’s shortest-path algorithm. In HMM-based speech recognition systems,
the Viterbi scoring plays a significant role in finding the best matching model,
but its computational complexity is linearly proportional to the number of
reference models and their states. Therefore, the complexity is serious in
implementing a high-speed speech recognition system. In the proposed
method, the Viterbi scoring is translated into the searching of a minimum path,
and the shortest-path algorithm is exploited to decrease the computational
complexity while preventing the recognition accuracy from deteriorating. More >
Login
Register
