<?xml version="1.0" standalone="yes"?>
<Paper uid="A88-1033">
  <Title>COMBINATORIAL DISAMBIGUATION</Title>
  <Section position="3" start_page="0" end_page="0" type="intro">
    <SectionTitle>
1. Introduction
</SectionTitle>
    <Paragraph position="0"> The disambiguation of sentences is a combinatorial problem. Identification of one word sense interacts with the identification of other word senses, (I) lie addressed the chair and with constituent attachment, (2) He shot some bucks with a rifle Moreover, the attachment of one constituent interacts with the attachment of other constituents: (3) She put the vase on the table in the living room This paper describes a method of addressing the problem directly, by adapting standard searctl optimization techniques, in the first section we describe the core of the method, which applies a version of best-.first search to a uniform representation of the set of possibilities. In the second section we relate the work to other approaches to preference-based disambiguation. &amp;quot;l&amp;quot;he final sections describe how the representation may he obtained from a lexicon.</Paragraph>
  </Section>
class="xml-element"></Paper>