<?xml version="1.0" standalone="yes"?>
<Paper uid="N03-3005">
  <Title>Indexing Methods for Efficient Parsing</Title>
  <Section position="11" start_page="0" end_page="0" type="concl">
    <SectionTitle>
10 Conclusions
</SectionTitle>
    <Paragraph position="0"> In this paper, we presented an indexing method that uses a hash to index categories during chart parsing.</Paragraph>
    <Paragraph position="1"> This method works for both context-free grammars with atomic categories, and typed feature structure grammars.</Paragraph>
    <Paragraph position="2"> The index keys rely on compatibility relations between rules' mothers and daughters statically determined before parsing. Other techniques (like statistic-based quick-check tests or feature re-ordering) can be combined in order to improve the parsing time. Overall, static analysis of grammar rules that index daughters by their position proved to be an efficient method that eliminates the training needed by statistical indexing techniques. Statistical data can improve this method especially by means of feature re-ordering.</Paragraph>
  </Section>
class="xml-element"></Paper>