<?xml version="1.0" standalone="yes"?>
<Paper uid="P96-1058">
  <Title>Maximizing Top-down Constraints for Unification-based Systems</Title>
  <Section position="5" start_page="382" end_page="382" type="relat">
    <SectionTitle>
4 Related Work
</SectionTitle>
    <Paragraph position="0"> A similar solution to the nontermination problem with unification grammars in Prolog is proposed in (Samuelsson, 1993). In this method, an operation called anti-unification (often referred to as generalization as the counterpart of unification) is applied to the root and leaf terms of a cyclic propagation, and the resulting term is stored in the reachablity table as the result of applying restriction on both terms. Another approach taken in (Haas, 1989) eliminates the cyclic propagation by replacing the features in the root and leaf terms with new variables. null The method proposed in this paper is more general than the above approaches: if the Selection ordering is imposed in the detection function, features in .restrictor. can be collected incrementally as the cyclic propagations are repeated. Thus, this method  possible situations.</Paragraph>
    <Paragraph position="1"> is able to create a less restrictive *restrictor. than these other approaches.</Paragraph>
  </Section>
class="xml-element"></Paper>