DocumentCode
3244332
Title
Phoneme-grapheme based speech recognition system
Author
Doss, M.M. ; Stephenson, Todd A. ; Bourlard, Heme ; Bengio, Samy
Author_Institution
Dalle Molle Inst. for Artificial Intelligence, Martigny, Switzerland
fYear
2003
fDate
30 Nov.-3 Dec. 2003
Firstpage
94
Lastpage
98
Abstract
State-of-the-art ASR systems typically use phonemes as the subword units. We investigate a system where the word models are defined in-terms of two different subword units, i.e., phonemes and graphemes. We train models for both the subword units, and then perform decoding using either both or just one subword unit. We have studied this system for American English where there is weak correspondence between grapheme and phoneme. We carried out the study in the framework of a state-of-the-art hybrid HMM/ANN system. The results show that there is good potential in using graphemes as auxiliary subword units.
Keywords
hidden Markov models; learning (artificial intelligence); natural languages; neural nets; speech recognition; ASR; American English; graphemes; hybrid HMM/ANN system; phonemes; speech recognition; subword units; word models; Artificial intelligence; Automatic speech recognition; Decision trees; Decoding; Hidden Markov models; Natural languages; Speech recognition; State estimation; Training data;
fLanguage
English
Publisher
ieee
Conference_Titel
Automatic Speech Recognition and Understanding, 2003. ASRU '03. 2003 IEEE Workshop on
Print_ISBN
0-7803-7980-2
Type
conf
DOI
10.1109/ASRU.2003.1318410
Filename
1318410
Link To Document