<?xml version="1.0" standalone="yes"?>
<Paper uid="P96-1058">
  <Title>Maximizing Top-down Constraints for Unification-based Systems</Title>
  <Section position="1" start_page="0" end_page="0" type="abstr">
    <SectionTitle>
Abstract
</SectionTitle>
    <Paragraph position="0"> A left-corner parsing algorithm with top-down filtering has been reported to show very efficient performance for unification-based systems. However, due to the non-termination of parsing with left-recursive grammars, top-down constraints must be weakened. In this paper, a general method of maximizing top-down constraints is proposed. The method provides a procedure to dynamically compute *restrictor., a minimum set of features involved in an infinite loop for every propagation path; thus top-down constraints are maximally propagated. null</Paragraph>
  </Section>
class="xml-element"></Paper>