DFKI Technical Memo-91-10

[Back]

TM-91-10



Language: English

by Béla Buschauer, Peter Poller, Anne Schauder, Karin Harbusch

Tree Adjoining Grammars mit Unifikation

149 Pages

Abstract

Tree Adjoining Grammars (TAGs) - as used in the parsing algorithm of Harbusch - can be improved with respect to compactness and transparency for the task of grammar design. We have combined the two formalisms Tree Adjoining Grammar and Unification in order to benifit from their respective advantages. Our approach is contrasted with the approach of Vijay-Shanker.

This document is available as PDF-File(97,1MB).

The next abstract is here, and the previous abstract is here.

DFKI-Bibliothek (bib@dfki.uni-kl.de)

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.