2005 · 15 citations · 10 references
Language StudiesComputer ScienceLinguisticsComputational LinguisticsNatural Language ProcessingPhoneticsLanguage ModelingPhonetic TranscriptionPhonological RulesPhonological SynthesisSpeech RecognitionSpeech SynthesisAutomatic Phonetic TranscriptionAutomatic TranscriptionFinite-state TransducersGrapheme-phoneme ConversionGrapheme-phoneme MappingPronunciation Lexicon LearningRule-based PhonologyTransducers
This paper describes a trainable method for generating letter to sound rules for the Greek language, for producing the pronunciation of out-of-vocabulary words. Several approaches have been adopted over the years for grapheme-to-phoneme conversion, such as hand-seeded rules, finite state transducers, neural networks, HMMs etc, nevertheless it has been proved that the most reliable method is a rule-based one. Our approach is based on a semi-automatically pre-transcribed lexicon, from which we derived rules for automatic transcription. The efficiency and robustness of our method are proved by experiments on out-of-vocabulary words which resulted in over than 98% accuracy on a word-base criterion.
10
Issues in Building General Letter to Sound Rules
Alan W. Black, Kevin Lenzo, Vincent Pagel · ERA · 1998 · 218 citations · Full text
Computing, Computer Science, French +12
Comparison of two tree-structured approaches for grapheme-to-phoneme conversion
Ove Andersen, Roland Kühn, Ariane Lazaridès et al. · 2002 · 52 citations
Grapheme-to-phone using finite-state transducers
2002 · 39 citations