Extended graph unification

Authors:
Allan Ramsay
Affiliations:
University of Sussex, Falmer
Venue:
EACL '89 Proceedings of the fourth conference on European chapter of the Association for Computational Linguistics
Year:
1989

Citing 2
Cited 0

A lazy way to chart-parse with Categorial Grammars

ACL '87 Proceedings of the 25th annual meeting on Association for Computational Linguistics
A unification method for disjunctive feature descriptions

ACL '87 Proceedings of the 25th annual meeting on Association for Computational Linguistics

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose an apparently minor extension to Kay's (1985) notation for describing directed acylic graphs (DAGs). The proposed notation permits concise descriptions of phenomena which out otherwise be difficult to describe, without incurring significant extra computational overheads in the process of unification. We illustrate the notation with examples from a categorial description of a fragment of English, and discuss the computational properties of unification of DAGs specified in this way.