This paper presents an adaptive algorithm for compensating pronunciation variations in hidden Markov model (HMM) based speech recognition. The proposed method aims to adapt the HMM topology and the corresponding HMM parameters to meet the variations of speaker dialects. In adaptive HMM topology, two hypothesis test schemes are designed to detect whether a new speaking variation occurs in state/phone levels. The test statistics are approximated by the chi-square densities. A new HMM topology is automatically generated by a significance level. Simultaneously, the HMM parameters and their hyperparameters are updated by Bayesian learning of the newly-generated Markov models. The pronunciation variations are coped with by a dialect adaptive HMM topology. We develop the incremental algorithm for corrective training of HMM topology and parameters. Experiments on TIMIT database show that the proposed algorithm is substantially better than the standard HMM with comparable size of parameters.
|頁（從 - 到）||1237-1240|
|期刊||Proceedings of the Annual Conference of the International Speech Communication Association, INTERSPEECH|
|出版狀態||Published - 1 十二月 2008|
|事件||INTERSPEECH 2008 - 9th Annual Conference of the International Speech Communication Association - Brisbane, QLD, Australia|
持續時間: 22 九月 2008 → 26 九月 2008