The University of Sussex

Extended graph unification

Allan Ramsay

The author proposes 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. The author illustrates 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.


This paper is not available online