Please use this identifier to cite or link to this item: doi:10.22028/D291-25078
Title: Tree adjoining grammars mit Unifikation
Author(s): Buschauer, Béla
Poller, Peter
Schauder, Anne
Harbusch, Karin
Language: English
Year of Publication: 1991
OPUS Source: Kaiserslautern ; Saarbrücken : DFKI, 1991
SWD key words: Künstliche Intelligenz
DDC notations: 004 Computer science, internet
Publikation type: Report
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 benefit from their respective advantages. Our approach is contrasted with the approach of Vijay-Shanker.
Link to this record: urn:nbn:de:bsz:291-scidok-38665
Series name: Technical memo / Deutsches Forschungszentrum für Künstliche Intelligenz [ISSN 0946-0071]
Series volume: 91-10
Date of registration: 12-Jul-2011
Faculty: SE - Sonstige Einrichtungen
Department: SE - DFKI Deutsches Forschungszentrum für Künstliche Intelligenz
Collections:SciDok - Der Wissenschaftsserver der Universität des Saarlandes

Files for this record:
File Description SizeFormat 
TM_91_10.pdf59,78 MBAdobe PDFView/Open

Items in SciDok are protected by copyright, with all rights reserved, unless otherwise indicated.