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

Authors:
Laura Kallmeyer;Frank Richter
Affiliations:
University of Tübingen;University of Tübingen
Venue:
TAGRF '06 Proceedings of the Eighth International Workshop on Tree Adjoining Grammar and Related Formalisms
Year:
2006

Citing 3
Cited 0

An efficient graph algorithm for dominance constraints

Journal of Algorithms - Special issue: Twelfth annual ACM-SIAM symposium on discrete algorithms
Feature structures based Tree Adjoining Grammars

COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 2
Licensing German negative polarity items in LTAG

TAGRF '06 Proceedings of the Eighth International Workshop on Tree Adjoining Grammar and Related Formalisms

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.