<?xml version="1.0" standalone="yes"?>
<Paper uid="P99-1066">
  <Title>Automatic Compensation for Parser Figure-of-Merit Flaws*</Title>
  <Section position="6" start_page="517" end_page="517" type="concl">
    <SectionTitle>
5 Conclusion
</SectionTitle>
    <Paragraph position="0"> In the prior work, we see the average edge cost of a chart parse reduced from 170,000 or so down to 229.7. This paper gives a simple modification to the \[Gold98\] algorithm that further reduces this count to just over 90 edges, less than two times the perfect minimum number of edges. In addition to speeding up tag-stream parsers, it seems reasonable to assume that the demeriting system would work in other classes of parsers such as the lexicalised model of (Charniak, 1997)--as long as the parsing technique has some sort of demeritable ranking system, or at least some way of paying less attention to already-filled positions, the kernel of the system should be applicable. Furthermore, because of its ease of implementation, we strongly recommend the demeriting system to those working with best-first parsing.</Paragraph>
  </Section>
class="xml-element"></Paper>