An Iterative Growing and Pruning Algorithm for Classification Tree Design
IEEE Transactions on Pattern Analysis and Machine Intelligence
Regular models of phonological rule systems
Computational Linguistics - Special issue on computational phonology
Progress in speech synthesis
Heterogeneous relation graphs as a formalism for representating linguistic information
Speech Communication - Special issue on speech annotation and corpus tools
Finite-State Language Processing
Finite-State Language Processing
Multilingual Text-to-Speech Synthesis
Multilingual Text-to-Speech Synthesis
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Finite-state transducers in language and speech processing
Computational Linguistics
On some applications of finite-state automata theory to natural language processing
Natural Language Engineering
ACL '94 Proceedings of the 32nd annual meeting on Association for Computational Linguistics
Compilation of weighted finite-state transducers from decision trees
ACL '96 Proceedings of the 34th annual meeting on Association for Computational Linguistics
An efficient compiler for weighted rewrite rules
ACL '96 Proceedings of the 34th annual meeting on Association for Computational Linguistics
| Hi-index | 0.00 |
This article presents a new unified approach to modeling grapheme-to-phoneme conversion for the PLATTOS Slovenian text-to-speech system. A cascaded structure consisting of several successive processing steps is proposed for the aim of grapheme-to-phoneme conversion. Processing foreign words and rules for the post-processing of phonetic transcriptions are also incorporated in the engine. The grapheme-to-phoneme conversion engine is flexible, efficient, and appropriate for multilingual text-to-speech systems. The grapheme-to-phoneme conversion process is described via finite-state machine formalism. The engine developed for Slovenian language can be integrated into various applications but can be even more efficiently integrated into architectures based on finite-state machine formalisms. Provided the necessary language resources are available, the presented approach can also be used for other languages.