3 search results - page 1 / 1 » Transducers from Rewrite Rules with Backreferences |
CORR
1999
Springer
13 years 4 months ago
1999
Springer
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...
CORR
1998
Springer
13 years 4 months ago
1998
Springer
Abstract. This paper presents a novel formalization of optimality theory. Unlike previous treatments of optimality in computational linguistics, starting with Ellison 1994 , the n...