Sciweavers

223 search results - page 5 / 45
» Constructing Lexical Transducers
Sort
View
ACL
2010
14 years 7 months ago
Efficient Inference through Cascades of Weighted Tree Transducers
Weighted tree transducers have been proposed as useful formal models for representing syntactic natural language processing applications, but there has been little description of ...
Jonathan May, Kevin Knight, Heiko Vogler
ACL
1998
14 years 11 months ago
Terminology Finite-State Preprocessing for Computational LFG
This paper presents a technique to deal with multiword nominal terminology in a computational Lexical Functional Grammar. This method treats multiword terms as single tokens by mo...
Caroline Brun
ACL
1996
14 years 11 months ago
Compilation of Weighted Finite-State Transducers from Decision Trees
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...
Richard Sproat, Michael Riley
CICLING
2003
Springer
15 years 2 months ago
Computing with Realizational Morphology
The theory of realizational morphology presented by Stump in his influential book Inflectional Morphology (2001) describes the derivation of inflected surface forms from underly...
Lauri Karttunen
66
Voted
CAV
2001
Springer
83views Hardware» more  CAV 2001»
15 years 2 months ago
Iterating Transducers
Regular languages have proved useful for the symbolic state exploration of infinite state systems. They can be used to represent infinite sets of system configurations; the tran...
Dennis Dams, Yassine Lakhnech, Martin Steffen