2 search results - page 1 / 1 » Re-Engineering Letter-to-Sound Rules |
NAACL
2001
13 years 6 months ago
2001
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 a...
SCAM
2003
IEEE
13 years 10 months ago
2003
IEEE
We characterise a computational model for processing annotated parse trees. The model is basically rewriting-based with specific provisions for dealing with annotations along the...