Sciweavers

Share
NAACL
2001

Re-Engineering Letter-to-Sound Rules

12 years 1 months ago
Re-Engineering Letter-to-Sound Rules
Using finite-state automata for the text analysis component in a text-to-speech system is problematic in several respects: the rewrite rules from which the automata are compiled are difficult to write and maintain, and the resulting automata can become very large and therefore inefficient. Converting the knowledge represented explicitly in rewrite rules into a more efficient format is difficult. We take an indirect route, learning an efficient decision tree representation from data and tapping information contained in existing rewrite rules, which increases performance compared to learning exclusively from a pronunciation lexicon.
Martin Jansche
Added 31 Oct 2010
Updated 31 Oct 2010
Type Conference
Year 2001
Where NAACL
Authors Martin Jansche
Comments (0)
books