Graph unification
Related Topics
Experts

1

2

3

4

5
Publications (23)

1QuasiDestructive Graph Unification1991  Hideto TomabechiQuasiDestructive Graph Unification Hideto Tomabechi Carnegie Mellon University ATR Interpreting Telephony 109 EDSH,...

2MemoryEfficient and ThreadSafe QuasiDestructive Graph Unification2000  Marcel P. van LohuizenMemoryEfficient and ThreadSafe QuasiDestructive Graph Unification Marcel P. van Lohuizen Department of Information Technology...

3Unification With Lazy NonRedundant Copying1991  Martin C. Emeleequality constraints, efficient graph unification algorithms exist. The graph unification algorithm presented by AitKaci...

4Lazy Unification1990  Godden, Kurtstatistics are given for the original implementation of graph unification in the TASLINK natural language system. TASLINK was...

5Constraint Projection: An Efficient Treatment Of Disjunctive Feature Descriptions1991  Mikio NakanoThese works are based on graph unification rather than on term unification. Graph unification has the advantage that the...

6A Lazy way to ChartParse with Categorial Grammars1987  Remo Pareschi,Mark Steedmantwe offer further on. 2.1. A Restricted Version of Graphunification We assume, like all unification formalisms, that ...

7Translating a Unification Grammar with Disjunctions into Logical Constraints1998  Mikio Nakano,Akira Shimazueach other. The treatment of named disjunctions in graph unification requires a complex process, while it is simple in our...

8Efficient Parsing For FrenchConstraints on word order are enforced by features and graph unification (CUG) or by Linear Precedence (LP) statements (HPSG...

9A Bag of Useful Techniques for Efficient and Robust ParsingJohn Carroll and Robert Malouf. 1999. Efficient graph unification for parsing featurebased grammars. University of Sussex...

10ConstraintBased Event Recognition For Information Extraction1995  Jeremy Croweions to the time and locationphrases they find. Graph unification is then used to build a set of constraints determining...