12 search results - page 1 / 3 » An Efficient Compiler for Weighted Rewrite Rules |
ACL
1996
13 years 6 months ago
1996
Context-dependent rewrite rules are used in many areas of natural language and speech processing. Work in computational phonology has demonstrated that, given certain conditions, ...
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...
ACL
1996
13 years 6 months ago
1996
We report on a method for compiling decision trees into weighted finite-state transducers. The key assumptions are that the tree predictions specify how to rewrite symbols from an...
ENTCS
2008
13 years 4 months ago
2008
In any language designed to express transformations, the notion of rewrite rule is a key feature. Its conciseness as well as its strong theoretical foundations are essential. The ...
CSCLP
2008
Springer
13 years 6 months ago
2008
Springer
In this paper, we present a rule-based modelling language for constraint programming, called Rules2CP. Unlike other modelling languages, Rules2CP adopts a single knowledge represen...