NIPS-3 Proceedings of the 1990 conference on Advances in neural information processing systems 3
Robust speech detection method for telephone speech recognition system
Speech Communication
Strategies for name recognition in automatic directory assistance systems
Speech Communication - Special issue on interactive voice technology for telecommunication applications
Speech Communication - Special issue on interactive voice technology for telecommunication applications
The acoustic-modeling problem in automatic speech recognition
The acoustic-modeling problem in automatic speech recognition
Improved spelling recognition using a tree-based fast lexical match
ICASSP '99 Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 02
Thai spelling recognition using a continuous speech corpus
COLING '04 Proceedings of the 20th international conference on Computational Linguistics
An HMM-based method for Thai spelling speech recognition
Computers & Mathematics with Applications
Thai spelling analysis for automatic spelling speech recognition
Information Sciences: an International Journal
Improving thai spelling recognition with tone features
FinTAL'06 Proceedings of the 5th international conference on Advances in Natural Language Processing
Hi-index | 0.01 |
In this paper we present a hypothesis-verification approach for a Spanish recognizer of continuously spelled names over the telephone. We give a detailed description of the spelling task for Spanish where the most confusable letter sets are described. We introduce a new HMM topology with contextual silences incorporated into the letter model to deal with pauses between letters, increasing the Letter Accuracy by 6.6 points compared with a single silence model approach. For the final configuration of the hypothesis step we obtain a Letter Accuracy of 88.1% and a Name Recognition Rate of 94.2% for a 1000 names dictionary. In this configuration, we also use noise models for reducing letter insertions, and a Letter Graph to incorporate N-gram language models and to calculate the N-best letter sequences. In the verification step, we consider the M-best candidates provided by the hypothesis step. We evaluate the whole system for different dictionaries, obtaining more than 90.0% Name Recognition Rate for a 10,000 names dictionary. Finally, we demonstrate the utility of incorporating a Spelled Name Recognizer in a Directory Assistance Service over the telephone increasing the percentage of calls automatically serviced from 39.4% to 58.7%.