DocumentCode
2957392
Title
Fast and robust stochastic segment model for Mandarin digital string recognition
Author
Liu, Wenju ; Tang, Yun ; Peng, Shouye
Author_Institution
Nat. Lab. of Pattern Recognition, Chinese Acad. of Sci., Beijing
fYear
2008
fDate
1-8 June 2008
Firstpage
1445
Lastpage
1449
Abstract
Based on the analysis and comparisons of complexity between stochastic segment model (SSM) and hidden Markov model (HMM) in this paper, we presented a fast and robust SSM, which yields a 94.75% speaker-independent performance on Mandarin digit string recognition. This result is better than HMM based system at the same level of computational complexity and just only a little slower than HMM in the running time. We also studied a region based discriminative method, which achieves 18.0% error rate reduction for substitution error and 95.08% accuracy for Mandarin digit string recognition.
Keywords
hidden Markov models; natural languages; speaker recognition; stochastic processes; HMM based system; Mandarin digital string recognition; computational complexity; hidden Markov model; region based discriminative method; robust stochastic segment model; speaker-independent performance; Neural networks; Robustness; Stochastic processes;
fLanguage
English
Publisher
ieee
Conference_Titel
Neural Networks, 2008. IJCNN 2008. (IEEE World Congress on Computational Intelligence). IEEE International Joint Conference on
Conference_Location
Hong Kong
ISSN
1098-7576
Print_ISBN
978-1-4244-1820-6
Electronic_ISBN
1098-7576
Type
conf
DOI
10.1109/IJCNN.2008.4633987
Filename
4633987
Link To Document