<?xml version="1.0" standalone="yes"?>
<Paper uid="C02-1066">
  <Title>Guaranteeing Parsing Termination of Uni cation Grammars</Title>
  <Section position="8" start_page="0" end_page="0" type="concl">
    <SectionTitle>
6 Conclusions
</SectionTitle>
    <Paragraph position="0"> In this paper we compare several variants of the OLP constraint for the rst time. We give sketches of proofs of undecidability of three OLP conditions, full proofs along with undecidability proofs of other conditions are given in Jaeger et al. (2002). In Jaeger et al. (2002) we also give a novel OLP constraint as well as an algorithm for deciding whether a grammar satis es it. The constraint is applicable to all uni cation grammar formalisms. It is more liberal than the existing constraints that are limited to skeletal grammars only, yet, unlike all de nitions that are applicable to general uni cation grammars, it can be tested ef ciently.</Paragraph>
  </Section>
class="xml-element"></Paper>