Sciweavers

415 search results - page 4 / 83
» Tree Unification Grammar
Sort
View
COLING
2002
13 years 6 months ago
Lenient Default Unification for Robust Processing within Unification Based Grammar Formalisms
This paper describes new default unification, lenient default unification. It works efficiently, and gives more informative results because it maximizes the amount of information ...
Takashi Ninomiya, Yusuke Miyao, Jun-ichi Tsujii
ACL
2006
13 years 7 months ago
Partially Specified Signatures: A Vehicle for Grammar Modularity
This work provides the essential foundations for modular construction of (typed) unification grammars for natural languages. Much of the information in such grammars is encoded in...
Yael Cohen-Sygal, Shuly Wintner
ACL
2000
13 years 7 months ago
Memory-Efficient and Thread-Safe Quasi-Destructive Graph Unification
In terms of both speed and memory consumption, graph unification remains the most expensive component of unification-based grammar parsing. We present a technique to reduce the me...
Marcel P. van Lohuizen
ACL
1998
13 years 7 months ago
Translating a Unification Grammar with Disjunctions into Logical Constraints
This paper proposes a method for generating a logicalconstraint-based internal representation from a unification grammar formalism with disjunctive information. Unification gramma...
Mikio Nakano, Akira Shimazu
ACL
2012
11 years 8 months ago
Strong Lexicalization of Tree Adjoining Grammars
Recently, it was shown (KUHLMANN, SATTA: Tree-adjoining grammars are not closed under strong lexicalization. Comput. Linguist., 2012) that finitely ambiguous tree adjoining gramm...
Andreas Maletti, Joost Engelfriet