<?xml version="1.0" standalone="yes"?>
<Paper uid="C92-4185">
  <Title>UNIFYING DISJUNCTIVE FEATURE STRUCTURES</Title>
  <Section position="2" start_page="0" end_page="0" type="intro">
    <SectionTitle>
Abstract
</SectionTitle>
    <Paragraph position="0"> This paper describes an algorithm for unifying disjunctive feature structnres. Unlike previous algorithms, except Eisele &amp; l)6n'e (1990), this algorithm is as fast as an algorithm withont disjunction when disjunctions do not participate in the unification, it is also as fast as an algorithm handling only local disjunctions when there are only local disjunctions, and expensive only in tile case of unifying fnll disjunction. The description is given in the fiamework of graph unification algoritbnls which ulakes it easy to implement as an extension of such an algorithm.</Paragraph>
  </Section>
class="xml-element"></Paper>