Bitte benutzen Sie diese Referenz, um auf diese Ressource zu verweisen: doi:10.22028/D291-25040
Titel: Realization of tree adjoining grammars with unification
Verfasser: Kilger, Anne
Sprache: Englisch
Erscheinungsjahr: 1992
Quelle: Kaiserslautern ; Saarbrücken : DFKI, 1992
SWD-Schlagwörter: Künstliche Intelligenz
DDC-Sachgruppe: 004 Informatik
Dokumentart : Report (Bericht)
Kurzfassung: 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 zu diesem Datensatz: urn:nbn:de:bsz:291-scidok-38803
hdl:20.500.11880/25096
http://dx.doi.org/10.22028/D291-25040
Schriftenreihe: Technical memo / Deutsches Forschungszentrum für Künstliche Intelligenz [ISSN 0946-0071]
Band: 92-08
SciDok-Publikation: 6-Jul-2011
Fakultät: Sonstige Einrichtungen
Fachrichtung: SE - DFKI Deutsches Forschungszentrum für Künstliche Intelligenz
Fakultät / Institution:SE - Sonstige Einrichtungen

Dateien zu dieser Ressource:
Datei Beschreibung GrößeFormat 
TM_92_08.pdf367,42 kBAdobe PDFÖffnen/Anzeigen


Alle Ressourcen in diesem Repository sind urheberrechtlich geschützt.