<?xml version="1.0" standalone="yes"?>
<Paper uid="P06-1052">
  <Title>Sydney, July 2006. c(c)2006 Association for Computational Linguistics An Improved Redundancy Elimination Algorithm for Underspecified Representations</Title>
  <Section position="2" start_page="0" end_page="0" type="abstr">
    <SectionTitle>
Abstract
</SectionTitle>
    <Paragraph position="0"> We present an efficient algorithm for the redundancy elimination problem: Given an underspecified semantic representation (USR) of a scope ambiguity, compute an USR with fewer mutually equivalent readings. Thealgorithm operateson underspecified chart representations which are derived from dominance graphs; it can be applied to the USRs computed by large-scale grammars. We evaluate the algorithm on a corpus, and show that it reduces the degree of ambiguity significantly while taking negligible runtime.</Paragraph>
  </Section>
class="xml-element"></Paper>