<?xml version="1.0" standalone="yes"?>
<Paper uid="W06-1515">
  <Title>Sydney, July 2006. c(c)2006 Association for Computational Linguistics Constraint-based Computational Semantics: A Comparison between LTAG and LRS</Title>
  <Section position="2" start_page="0" end_page="0" type="abstr">
    <SectionTitle>
Abstract
</SectionTitle>
    <Paragraph position="0"> This paper compares two approaches to computational semantics, namely semantic unification in Lexicalized Tree Adjoining Grammars (LTAG) and Lexical Resource Semantics (LRS) in HPSG.</Paragraph>
    <Paragraph position="1"> 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.</Paragraph>
  </Section>
class="xml-element"></Paper>