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.
Download full text files
Export metadata
Additional Services
| Author: | Laura Kallmeyer, Frank Richter |
|---|---|
| URN: | urn:nbn:de:hebis:30-1110209 |
| Document Type: | Article |
| Language: | English |
| Date of Publication (online): | 20.10.2008 |
| Year of first Publication: | 2006 |
| Publishing Institution: | Univ.-Bibliothek Frankfurt am Main |
| Tag: | Lexical Resource Semantics; Lexicalized Tree Adjoining Grammar |
| Source: | http://www.sfb441.uni-tuebingen.de/~lk/papers/kallmrichter-tag+8.pdf ; Proceedings of the 8th International Workshop on Tree Adjoining Grammar and Related Formalisms (Sydney 2006), S.109-114. |
| HeBIS PPN: | 206688113 |
| Dewey Decimal Classification: | 400 Sprache |
| Sammlungen: | Linguistik |
| Linguistik-Klassifikation: | Linguistik-Klassifikation: Computerlinguistik / Computational linguistics |
| Licence (German): |  Veröffentlichungsvertrag für Publikationen ohne Print on Demand |
