DFKI Technical Memo-92-08
by Anne Kilger
Realization of Tree Adjoining Grammars with Unification
The syntactic generator of the WIP system is based on the representation formalism 'Tree Adjoining Grammars' (TAGs). We have extended the formalism by associating elementary rules of the grammar (trees) with feature structures, leading to 'Tree Adjoining Grammars with Unification' (UTAGs). The extended formalism facilitates a compact and adequate representation of complex syntactic features.
The contradiction between the monotonic operation of unification and the combination operation for trees - adjunction - that is nonmonotonic in a way can be solved by several approaches to realization. Two of them are presented in this work and compared with respect to the restrictions that are given by the system, i.e., the adequacy of the realization for incremental and parallel generation.
It can be shown that UTAGs are subsumed by FTAGs (Feature Structure based TAGs) that have been defined by Vijay-Shanker and Joshi. That is why the results for realization can be applied to both UTAGs and a restricted version of FTAGs.
This document is available as Postscript.
The next abstract is here, and the previous abstract is here.
Note: This page was written to look best with CSS stylesheet support Level 1 or higher. Since you can see this, your browser obviously doesn't support CSS, or you have turned it off. We highly recommend you use a browser that supports and uses CSS, and review this page once you do. However, don't fear, we've tried to write this page to still work and be readable without CSS.