Thai spelling recognition using a continuous speech corpus

Authors:
Chutima Pisarn;Thanaruk Theeramunkong
Affiliations:
Sirindhorn International Institute of Technology, Bangkadi, Muang, Phathumthani, Thailand;Sirindhorn International Institute of Technology, Bangkadi, Muang, Phathumthani, Thailand
Venue:
COLING '04 Proceedings of the 20th international conference on Computational Linguistics
Year:
2004

Citing 3
Cited 1

Speech and Language Processing: An Introduction to Natural Language Processing, Computational Linguistics, and Speech Recognition

Speech and Language Processing: An Introduction to Natural Language Processing, Computational Linguistics, and Speech Recognition
Spanish recognizer of continuously spelled names over the telephone

Speech Communication
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 speech processing technology: A review

Speech Communication

Quantified Score

Hi-index	0.00

Visualization

Abstract

Spelling recognition is an approach to enhance a speech recognizer's ability to cope with incorrectly recognized words and out-of-vocabulary words. This paper presents a general framework for Thai speech recognition enhanced with spelling recognition. In order to implement Thai spelling recognition, Thai alphabets and their spelling methods are analyzed. Based on hidden Markov models, we propose a method to construct a Thai spelling recognition system by using an existing continuous speech corpus. To compensate the difference between spelling utterances and continuous speech utterances, the adjustment of utterance speed is taken into account. Assigning different numbers of states for syllables with different durations is helpful to improve the recognition accuracy. Our system achieves up to 79.38% accuracy.