Hidden Markov models and selectively trained neural networks for connected confusable word recognition
暂无分享,去创建一个
This paper presents a new method for connected-word recognition with confusable vocabularies, such as connected letters. The recognition process is performed in two steps. First, a second-order HMM provides N-best word strings. Then, the strings of confusable letters are discriminated by a procedure based on acoustic knowledge and artificial neural networks (ANN). This method has been tested on an American-English database containing spelled names collected through the telephone network. The results obtained with the first HMM pass and the improvements made with the ANN are presented and discussed. When a 3,300 name dictionary and a retrieval procedure based on a DTW alignment algorithm were used, 96% recognition accuracy was obtained.
[1] Richard M. Schwartz,et al. Efficient, High-Performance Algorithms for N-Best Search , 1990, HLT.
[2] Ronald A. Cole,et al. A telephone speech database of spelled and spoken names , 1992, ICSLP.
[3] Abdelaziz Kriouile,et al. Automatic word recognition based on second-order hidden Markov models , 1994, IEEE Trans. Speech Audio Process..
[4] Ronald A. Cole,et al. Speaker-independent English alphabet recognition: experiments with the e-set , 1990, ICSLP.