A unified approach to grapheme-to-phoneme conversion for the plattos Slovenian text-to-speech system

Applied Artificial Intelligence

Volumn 21, Issue 6, 2007, Pages 563-603

  Rojc, Matej ^a   Kacic, Zdravko ^a  

^a UNIVERSITY OF MARIBOR   (Slovenia)

Author keywords

[No Author keywords available]

Indexed keywords

FINITE AUTOMATA; SPEECH ANALYSIS; SPEECH PROCESSING; TEXT PROCESSING;

GRAPHEME-TO-PHONEME CONVERSION; SLOVENIAN LANGUAGE; TEXT-TO-SPEECH SYSTEMS;

FORMAL LANGUAGES;

EID: 34547341227     PISSN: 08839514     EISSN: 10876545     Source Type: Journal    
DOI: 10.1080/08839510701409086     Document Type: Article

References (28)

1. Breiman, L., J. Freidman, R. Olshen, and C. Stone. 1984. Classification and Regression Trees. New York: Chapman & Hall.
2. 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.
3. Emmanuel, R. and Y. Schabes. 1997. Finite State Language Processing. The Massachusetts Institute of Technology: MIT Press.
4. 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.
5. 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.
6. 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.
7. Hopcroft, J. E. and J. D. Ullman. 1979. Introduction to Automata Theory, Languages, and Computation. Reading, Mass.: Addison Wesley.
8. Kaplan, R. M. and M. Kay. 1994. Regular models of phonological rule systems. Computational Linguistics 20(3):331-378.
9. Kiraz, G. A. and B. Mobius. 1998. Multilingual syllabification using weighted finite-state transducers. Proceedings of the Third International Workshop on Speech Synthesis, Australia.
10. Kuich, W. and A. Salomaa. 1986. Semirings, automata, languages. In Monographs on Theoretical Computer Science. Berlin: Springer Verlag.
11. 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.
12. Mohri, M. 1994. Minimization of sequential transducers. In Lecture Notes in Computer Science, pp. 151-163, Berlin: Springer Verlag.
13. Mohri, M. 1995. On some applications of finite-state automata theory to natural language processing. Natural Language Engineering 1:1-20.
14. Mohri, M. 1997. Finite-state transducers in language and speech processing. Computational Linguistics 23(2):269-311.
15. 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.
16. Multext. 1996. http://www.lpl.univ-aix.fr/projects/multext
17. Onomastica. 1995. http://www.elda.fr/catalogue/speech/s0043.html
18. Pagel, V., K. Lenzo, and A. W. Black. 1998. Letter to sound rules for accented lexicon compression. In Proceedings of the ICSLP, Sydney, Australia.
19. 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.
20. Rojc, M. 2003. Time and space optimal architecture of the multilingual and polyglot TTS system - architecture with finite-state machine. Ph.D. thesis, Faculty of Electrical Engineering and Computer Science, University of Maribor, Maribor, Slovenia.
21. Rojc, M. and Z. Kacic. 2000. A computational platform for development of morphologic and phonetic lexica. In LREC 2000, Athens, Greece.
22. Sproat, R. 1998. Multilingual, Text-to-Speech Synthesis. The Netherlands: Kluwer Academic Publishers.
23. Sproat, R, 2001, Pmtools: A pronunciation modeling toolkit. In Fourth ISCA ITKW on Speech Synthesis, Blair Atholl, Scotland.
24. 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.
25. 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.
26. 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.
27. 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.
28. 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.