REFERENCES
- Breiman , L. , J. Freidman , R. Olshen , and C. Stone . 1984 . Classification and Regression Trees . New York : Chapman & Hall .
- Daciuk , J. 1998 . Incremental construction of finite-state automata and transducers and their use in the natural language processing. Ph.D. thesis , Technical University of Gdansk , Gdansk , Poland .
- Emmanuel , R. and Y. Schabes . 1997 . Finite State Language Processing . The Massachusetts Institute of Technology: MIT Press .
- Galescu , L. and J. F. Allen . 2002 . Pronunciation of proper names with a joint n-gram model for bi-directional grapheme-to-phoneme conversion . In Proceedings of the ICSLP , pp. 109–112, Denver , CO, USA .
- Gelfand , S. , C. Ravishankar , and E. Delp . 1991 . An iterative growing and pruning algorithm for classification tree design . IEEE Trans. PAMI 13 ( February ): 163 – 174 .
- Hain , H. U. 2000 . A hybrid approach for grapheme-to-phoneme conversion based on combination of partial string matching and a neural network . In Proceedings of the ICSLP , Vol. 3 , pp. 291 – 294 , Beijing , China .
- Hopcroft , J. E. and J. D. Ullman . 1979 . Introduction to Automata Theory, Languages, and Computation . Reading , Mass .: Addison Wesley .
- Kaplan , R. M. and M. Kay . 1994 . Regular models of phonological rule systems . Computational Linguistics 20 ( 3 ): 331 – 378 .
- Kiraz , G. A. and B. Mobius . 1998 . Multilingual syllabification using weighted finite-state transducers . Proceedings of the Third International Workshop on Speech Synthesis , Australia .
- Kuich , W. and A. Salomaa . 1986 . Semirings, automata, languages . In Monographs on Theoretical Computer Science . Berlin : Springer Verlag .
- Liberman , M. J. and K. W. Church . 1992 . Text analysis and word pronunciation in text-to-speech synthesis . In Advances in Speech Signal Processing . New York : Dekker .
- Mohri , M. 1994 . Minimization of sequential transducers . In Lecture Notes in Computer Science . pp. 151–163, Berlin: Springer Verlag .
- Mohri , M. 1995 . On some applications of finite-state automata theory to natural language processing . Natural Language Engineering 1 : 1 – 20 .
- Mohri , M. 1997 . Finite-state transducers in language and speech processing . Computational Linguistics 23 ( 2 ): 269 – 311 .
- Mohri , M. and R. Sproat . 1996 . An efficient compiler for weighted rewrite rules . In 34th Meeting of the Association for Computational Linguistics (ACL 96) . Santa Cruz , California .
- Multext . 1996 . http://www.lpl.univ-aix.fr/projects/multext
- Onomastica . 1995 . http://www.elda.fr/catalogue/speech/s0043.html
- Pagel , V. , K. Lenzo , and A. W. Black . 1998 . Letter to sound rules for accented lexicon compression . In Proceedings of the ICSLP , Sydney , Australia .
- Rojc , M. 2000 . Use of finite-state machines in automatic text-to-speech synthesis systems. M.Sc. thesis , Faculty of Electrical Engineering and Computer Science, University of Maribor , Maribor , Slovenia .
- Rojc , M. 2003 . Time and space optimal architecture of the multilingual and polyglot TTS system—architecture with finite-state machines. Ph.D. thesis , Faculty of Electrical Engineering and Computer Science, University of Maribor , Maribor , Slovenia .
- Rojc , M. and Z. Kacic . 2000 . A computational platform for development of morphologic and phonetic lexica . In LREC 2000 , Athens , Greece .
- Sproat , R. 1998 . Multilingual Text-to-Speech Synthesis . The Netherlands: Kluwer Academic Publishers .
- Sproat , R. 2001. Pmtools: A pronunciation modeling toolkit. In Fourth ISCA ITRW on Speech Synthesis , Blair Atholl , Scotland.
- Sproat , R. and M. Riley . 1996 . Compilation of weighted finite-state transducers from decision trees . In 34th Meeting of the Association for Computational Linguistics (ACL 96) , pp. 215 – 222 , Santa Cruz , California .
- Suontausta , J. and J. Hakkinenen . 2000 . Decision tree based text-to-phoneme mapping for speech recognition . In Proceedings of the ICSLP , pp. 199 – 202 , Beijing , China .
- Taylor , P. , A. W. Black , and R. Caley . 2001 . Heterogeneous relation graphs as a formalism for representing linguistic information . Speech Communication 33 ( 1–2 ): 153 – 174 .
- Yarowsky , D. 1994 . Decision lists for lexical ambiguity resolution . In Proceedings of the 32nd Annual Meeting of the Association for Computational Linguistics , pp. 88 – 95 .
- Yarowsky , D. 1997 . Homograph disambiguation in text-to-speech synthesis . In Progress in Speech Synthesis , eds. J. Olive , J. van Santen , R. Sproat , and J. Hirschberg , Springer , New York : Springer .