<?xml version="1.0" standalone="yes"?>
<Paper uid="P94-1040">
  <Title>RELATING COMPLEXITY TO PRACTICAL PERFORMANCE IN PARSING WITH WIDE-COVERAGE UNIFICATION GRAMMARS</Title>
  <Section position="16" start_page="292" end_page="292" type="concl">
    <SectionTitle>
6. CONCLUSIONS
</SectionTitle>
    <Paragraph position="0"> The research reported is in a similar vein to that of, for example, Moore &amp; Dowding (1991), Samuelsson &amp; Rayner (1991), and Maxwell &amp; Kaplan (1993), in that it relies on empirical results for the study and optimisation of parsing algorithms rather than on traditional techniques of complexity analysis. The paper demonstrates that research in this area will have to rely on empirical data until complexity theory is developed to a point where it is sufficiently fine-grained and accurate to predict how the properties of individual unification-based grammars will interact with particular parsing algorithms to determine practical performance.</Paragraph>
  </Section>
class="xml-element"></Paper>