<?xml version="1.0" standalone="yes"?>
<Paper uid="C96-2111">
  <Title>Top-Down Predictive Linking and Complex-Feature-Based Formalisms</Title>
  <Section position="5" start_page="662" end_page="662" type="concl">
    <SectionTitle>
4 Conclusion
</SectionTitle>
    <Paragraph position="0"> We have presented a technique based on the operation of generalization that provides for the automatic computation of a linking relation for use with complex-feature based grammar formalisms of the kind that are currently favored in computational linguistics. Although our proposal was developed lbr left-corner parsing with backtracking, it obviously carries over to other parsers with top-down prediction. A further goal of this paper is to motivate a shift of attention from linking as a mere filter to genuinely predictive linking as a valuable device for the top-down transport of information essential for other aspects of natural language parsing.</Paragraph>
  </Section>
class="xml-element"></Paper>