Skip to main content Skip to main navigation


Tree Adjoining Grammars mit Unifikation

Béla Buschauer; Peter Poller; Anne Schauder; Karin Harbusch
DFKI, DFKI Technical Memos (TM), Vol. 91-10, 1991.


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.