Abstract
A major weakness of conventional hidden Markov models is that they implicitly model state durations by a geometric distribution, which is usually inappropriate. This paper presents a modified Viterbi algorithm that, by incorporating proper state and word duration modeling, significantly reduces the string error rate of the conventional Viterbi algorithm for a speaker-independent, connected-digit string task. The algorithm has essentially the same computational requirements of the conventional Viterbi algorithm.
| Original language | English |
|---|---|
| Pages (from-to) | 240-242 |
| Number of pages | 3 |
| Journal | IEEE Transactions on Speech and Audio Processing |
| Volume | 4 |
| Issue number | 3 |
| DOIs | |
| State | Published - 1996 |