Eingang zum Volltext in OPUS

Hinweis zum Urheberrecht

ResearchPaper zugänglich unter
URN: urn:nbn:de:bsz:93-opus-936
URL: http://elib.uni-stuttgart.de/opus/volltexte/1999/93/

Sorted Feature Terms and Relational Dependencies

Dörre, Jochen ; Seiffert, Roland

Originalveröffentlichung:		(1991) IWBS-Report ; 153
pdf-Format:		Dokument 1.pdf (338 KB)
Dokument empfehlen:
Dokument in Google Scholar suchen:
SWD-Schlagwörter:		Merkmalsbeschreibungssprache , Constraint-logische Programmierung
Institut:		Institut für Maschinelle Sprachverarbeitung, Fachrichtung Computerlingustik
DDC-Sachgruppe:		Sprachwissenschaft, Linguistik
Dokumentart:		ResearchPaper
Sprache:		Englisch
Erstellungsjahr:		1991
Publikationsdatum:		15.06.1999
Kurzfassung auf Englisch:		In this paper we describe the key ideas of the unication-based grammar formalism STUF that is being developed and used within the LILOG project at IBM Germany. STUF integrates feature terms with sorts and recursive denitions of relations. We provide a twofold motiva tion for our approach: First, we show how sorts can be exploited to reduce the structural complexity - especially the number of structural disjunctions - of feature terms. Second, we demonstrate how our relational dependencies help to write more concise and elegant grammars in principle-based approaches like HPSG. The main contribution of this paper is to provide a complete formal semantics for our formalism that is also applicable to other related formalisms currently being investigated.