作者: Michael Gerber , Tobias Kaufmann , Beat Pfister
DOI: 10.1109/ICASSP.2011.5947462
关键词:
摘要: This paper deals with the problem of finding optimal sequence sub-word unit HMMs for a number given utterances word. For this we present new solution based on an extension Viterbi algorithm which maximizes joint probability and all possible sequences units hence guarantees to find solution. The was applied in isolated word recognition experiment compared simpler approaches determining units. We report significant reduction error rate algorithm.