Please use this identifier to cite or link to this item: doi:10.22028/D291-25040
Title: Realization of tree adjoining grammars with unification
Author(s): Kilger, Anne
Language: English
Year of Publication: 1992
OPUS Source: Kaiserslautern ; Saarbrücken : DFKI, 1992
SWD key words: Künstliche Intelligenz
DDC notations: 004 Computer science, internet
Publikation type: Report
Abstract: 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.
Link to this record: urn:nbn:de:bsz:291-scidok-38803
Series name: Technical memo / Deutsches Forschungszentrum für Künstliche Intelligenz [ISSN 0946-0071]
Series volume: 92-08
Date of registration: 6-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_92_08.pdf367,42 kBAdobe PDFView/Open

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