Abstract
We propose an apparently minor extension to Kay's (1985} notation for describing directed acyclic graphs (DAGs}. The proposed notation permits concise descriptions of phenomena which would 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.
Cite
CITATION STYLE
Ramsay, A. (1989). Extended Graph Unification. In 4th Conference of the European Chapter of the Association for Computational Linguistics, EACL 1989 - Proceedings (pp. 212–216). Association for Computational Linguistics (ACL). https://doi.org/10.3115/976815.976844
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
