Eingang zum Volltext in SciDok


Report (Bericht) zugänglich unter
URN: urn:nbn:de:bsz:291-scidok-38803

Realization of tree adjoining grammars with unification

Kilger, Anne

Quelle: (1992) Kaiserslautern ; Saarbrücken : DFKI, 1992
Dokument 1.pdf (367 KB)

Bookmark bei Connotea Bookmark bei
SWD-Schlagwörter: Künstliche Intelligenz
Institut: DFKI Deutsches Forschungszentrum für Künstliche Intelligenz
DDC-Sachgruppe: Informatik
Dokumentart: Report (Bericht)
Schriftenreihe: Technical memo / Deutsches Forschungszentrum für Künstliche Intelligenz [ISSN 0946-0071]
Bandnummer: 92-08
Sprache: Englisch
Erstellungsjahr: 1992
Publikationsdatum: 06.07.2011
Kurzfassung auf Englisch: 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.
Lizenz: Standard-Veröffentlichungsvertrag

Home | Impressum | Über SciDok | Policy | Kontakt | Datenschutzerklärung | English