IMPROVING PRONUNCIATION DICTIONARY COVERAGE OF NAMES BY MODELLING SPELLING VARIATION

5th ISCA Workshop on Speech Synthesis, SSW 2004

Volumn , Issue , 2004, Pages 121-126

  Fackrell, Justin ^a   Skut, Wojciech ^a  

^a Rhetorical Systems Ltd   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

DATA DRIVEN; MODEL VARIATION; OFFLINE; OUTOF-VOCABULARY WORDS (OOV); PRONUNCIATION DICTIONARIES; REWRITE RULES;

SPEECH SYNTHESIS;

EID: 85119097271     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (14)

1. Honey S. Elovitz, Rodney Johnson, Astrid McHugh, and John E. Shore, “Letter-to-sound rules for automatic translation of english text to phonetics,” in IEEE Transactions on Acoustics, Speech and Signal Processing ASSP-24, 1976, pp. 446–459.
2. Mehryar Mohri and Richard Sproat, “An efficient compiler for weighted rewrite rules,” in Meeting of the Association for Computational Linguistics, 1996, pp. 231–238.
3. I. Lee Hetherington, “An efficient implementation of phonological rules using finite-state transducers,” in Proceedings of Eurospeech 2001, 2001.
4. A. Black, K. Lenzo, and V. Pagel, “Issues in building general letter to sound rules,” in Proceedings of ESCA/COCOSDA Workshop on Speech Synthesis, Jenolan Caves, Australia, 1998.
5. Yannick Marchand and Robert I. Damper, “A multistrategy approach to improving pronunciation by analogy,” Computational Linguistics, vol. 26, no. 2, pp. 195–219, 2000.
6. M. Liberman and K. Church, “Text analysis and word pronunciation in text-to-speech synthesis,” in Advances in Speech Signal Processing, S. Furui and M. Sondhi, Eds. Marcel Dekker Inc, 1991.
7. Ariadna Font Llitjos and Alan W Black, “Knowledge of language origin improves pronunciation accuracy of proper names,” 2001.
8. J. Zobel and P. W. Dart, “Phonetic string matching: Lessons from information retrieval,” in Proceedings of the 19th International Conference on Research and Development in Information Retrieval, H.P. Frei, D. Harman, P. Schäble, and R. Wilkinson, Eds., Zurich, Switzerland, 1996, pp. 166–172, ACM Press.
9. Ulrich Pfeifer, Thomas Poersch, and Norbert Fuhr, “Searching proper names in databases,” in Hypertext - Information Retrieval - Multimedia, pp. 259–276. Universitätsverlag Konstanz, 1995.
10. Mehryar Mohri, “Finite-state transducers in language and speech processing,” Computational Linguistics, vol. 23, no. 2, pp. 269–311, 1997.
11. Stoyan Mihov and Denis Maurel, “Direct construction of minimal acyclic subsequential transducers,” Lecture Notes in Computer Science, vol. 2088, 2001.
12. Jan Daciuk, “Experiments with automata compression,” Lecture Notes in Computer Science, vol. 2088, pp. 105–112, 2001.
13. Kemal Oflazer, “Error-tolerant finite-state recognition with applications to morphological analysis and spelling correction,” Computational Linguistics, vol. 22, no. 1, pp. 73–89, 1996.
14. M. Crochemore and C. Hancart, “Automata for matching patterns,” in Handbook of Formal Languages, G. Rozenberg and A. Salomaa, Eds., vol. 2, pp. 399–462. Springer-Verlag, 1997.