TY  - RPRT
T1  - Tree adjoining grammars mit Unifikation 
T3  - Kaiserslautern ; Saarbrücken : DFKI, 1991
A1  - Buschauer,Béla
A1  - Poller,Peter
A1  - Schauder,Anne
A1  - Harbusch,Karin
Y1  - 2011/07/12
N2  - 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 benefit from their respective advantages. Our approach is contrasted with the approach of Vijay-Shanker. 
KW  - Künstliche Intelligenz
CY  - Saarbrücken
PB  - Universitäts- und Landesbibliothek
AD  - Postfach 151141, 66041 Saarbrücken
UR  - http://scidok.sulb.uni-saarland.de/volltexte/2011/3866
ER  -