TY  - INPR
A1  - Kallmeyer, Laura
A1  - Richter, Frank
T1  - Constraint-based computational semantics : a comparison between LTAG and LRS
N2  - 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.
KW  - Lexicalized Tree Adjoining Grammar
KW  - Lexical Resource Semantics
Y1  - 2008
UR  - http://publikationen.ub.uni-frankfurt.de/frontdoor/index/index/docId/9842
UR  - https://nbn-resolving.org/urn:nbn:de:hebis:30-1110209
UR  - http://www.sfs.uni-tuebingen.de/~lk/papers/kallmrichter-tag+8.pdf
SN  - 1-932432-85-X
N1  - 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
ER  -