<?xml version="1.0" standalone="yes"?>
<Paper uid="C92-4185">
  <Title>UNIFYING DISJUNCTIVE FEATURE STRUCTURES</Title>
  <Section position="11" start_page="0" end_page="0" type="concl">
    <SectionTitle>
9 Conclusion
</SectionTitle>
    <Paragraph position="0"> This paper describes an algot~ithm for unifying disjunctions which calls for as little computation as possible for each ease. Disjunctions only affect the complexity when they directly parucipate ~ are affected by the unification, which is the only case when we expand to disjunctive normal form. The most expensive work is done only when there is a failure in a disjunction which affects some other part of the structure. The only algorithm that shows similar complexity is the algorithm proposed by Eisele &amp; D0rre (1990). However the description given by Eisele and DOne is harder to relate and implement as a graph unification algorithm. This paper shows that it is possible to use Snililar ideas together with graph unification. The de,,;cription given here is fairdeg ly easy to implement as mi extension of a graph uni~ ficatiou algorithm.</Paragraph>
  </Section>
class="xml-element"></Paper>