| Hi-index | 0.00 |
A new pattern matching method, the partly hidden Markov model, is proposed and applied to speech recognition. The hidden Markov model, which is widely used for speech recognition, can deal with only piecewise stationary stochastic process. We solved this problem by introducing the modified second order Markov model, in which the first state is hidden and the second one is observable. In this model, not only the feature parameter observations but also the state transitions are dependent on the previous feature observation. Therefore, even the complicated transient can be modeled precisely. Some simulation experiments showed the high potential of the proposed model. From the results of the word recognition test is was observed that the error rate was reduced by 39% compared with the normal HMM.