1188 search results - page 1 / 238 » Extended Graph Unification |
EACL
1989
ACL Anthology
13 years 6 months ago
1989
ACL Anthology
We propose an apparently minor extension to Kay's (1985} notation for describing directed acyclic graphs (DAGs}. The proposed notation permits concise descriptions of phenome...
ENTCS
2002
13 years 4 months ago
2002
We define a notion of type assignment with polymorphic intersection types of rank 2 for a term graph rewriting language that expresses sharing and cycles. We show that type assign...
COLING
1992
13 years 6 months ago
1992
A formal treatment of typed feature structures (TFSs) is developed to augment TFSs, so that negative descriptions of them can be treated. Negative descriptions of TFSs can make li...
ACL
2000
13 years 6 months ago
2000
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...
BIBE
2000
IEEE
13 years 8 months ago
2000
IEEE
We present a theoretically founded framework for fuzzy unification and resolution based on edit distance over trees. Our framework extends classical unification and resolution con...