Automatic speech recognition tasks whose domains involve recognizing proper names are usually challenging due to the infinite number of possible lexical items. In some tasks such as automated directories, to avoid unconstrained recognitions, one could design the system to handle a finite number of proper names at a time. However, the recognition grammars need to be generated in unsupervised fashions. In this paper, a recognition system capable of selecting a Thai proper name from dynamic name lists was proposed and evaluated upon name lists of various sizes. The system decomposes names to sequences of Grams, lexical units defined with specific pronunciations and spellings, upon which pronunciation grammars are produced and utilized as recognition constraints. Recognition accuracies of above 85% to approximately 91% were obtained on lists containing 10 to 80 names.
展开▼
