<?xml version="1.0" standalone="yes"?>
<Paper uid="P98-1072">
  <Title>Semantic-Head Based Resolution of Scopal Ambiguities*</Title>
  <Section position="8" start_page="436" end_page="436" type="concl">
    <SectionTitle>
6 Conclusions
</SectionTitle>
    <Paragraph position="0"> We have presented an algorithm for scope resolution in underspecified semantic representations. Scope preferences are suggested on the basis of semantic argument structure, letting the nonhead daughter node outscope the head daughter in case both daughter nodes are scopebearing. The algorithm was evaluated on four &amp;quot;real-life&amp;quot; dialogues and fared quite well: about 80% of the utterances containing scopal ambiguities were correctly interpreted by the suggested resolution, leaving scopal resolution errors in only 5.7% of the overall utterances.</Paragraph>
    <Paragraph position="1"> The algorithm is computationally cheap and quite straight-forward, yet its predictions are relatively accurate. Our results indicate that for a practical system, more sophisticated approaches to scopal resolution (i.e., based on the relations between different scope-bearing elements and/or contextual information) will not add much to the overall system performance.</Paragraph>
  </Section>
class="xml-element"></Paper>