Sciweavers

Share
2 search results - page 1 / 1
» Re-Engineering Letter-to-Sound Rules
Sort
View
NAACL
2001
12 years 3 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 a...
Martin Jansche
SCAM
2003
IEEE
12 years 7 months ago
Parse-Tree Annotations Meet Re-Engineering Concerns
We characterise a computational model for processing annotated parse trees. The model is basically rewriting-based with speciļ¬c provisions for dealing with annotations along the...
Jan Kort, Ralf Lämmel
books