Constraint-based computational semantics : a comparison between LTAG and LRS

  • This paper compares two approaches to computational semantics, namely semantic unification in Lexicalized Tree Adjoining Grammars (LTAG) and Lexical Resource Semantics (LRS) in HPSG. There are striking similarities between the frameworks that make them comparable in many respects. We will exemplify the differences and similarities by looking at several phenomena. We will show, first of all, that many intuitions about the mechanisms of semantic computations can be implemented in similar ways in both frameworks. Secondly, we will identify some aspects in which the frameworks intrinsically differ due to more general differences between the approaches to formal grammar adopted by LTAG and HPSG.
Author:Laura KallmeyerORCiDGND, Frank RichterORCiDGND
Document Type:Preprint
Year of Completion:2008
Year of first Publication:2006
Publishing Institution:Universit├Ątsbibliothek Johann Christian Senckenberg
Release Date:2008/10/20
Tag:Lexical Resource Semantics; Lexicalized Tree Adjoining Grammar
Page Number:6
Erschienen in: The Eighth International Workshop on Tree Adjoining Grammar and Related Formalisms ; proceedings of the workshop, Stroudsburg, PA : Association for Computational Linguistics, 2006, S. 109-114, ISBN 1-932432-85-X
Source: ; Proceedings of the 8th International Workshop on Tree Adjoining Grammar and Related Formalisms (Sydney 2006), S.109-114.
Institutes:keine Angabe Fachbereich / Extern
Dewey Decimal Classification:4 Sprache / 40 Sprache / 400 Sprache
Linguistik-Klassifikation:Linguistik-Klassifikation: Computerlinguistik / Computational linguistics
Licence (German):License LogoDeutsches Urheberrecht