<?xml version="1.0" standalone="yes"?>
<Paper uid="N03-3005">
  <Title>Indexing Methods for Efficient Parsing</Title>
  <Section position="3" start_page="0" end_page="0" type="intro">
    <SectionTitle>
1.2 Related Work
</SectionTitle>
    <Paragraph position="0"> An empirical method that addresses the efficiency issue is quick-check (Malouf et al., 2000), a method that relies on statistical data collected through training. Other techniques are focused on implementational aspects (Wintner and Francez, 1999), or propose approaches similar to indexing for typed-feature structures (TFS) retrieval (Ninomiya et al., 2002). An automaton-based indexing for generation is proposed in (Penn and Popescu, 1997), while (Penn, 1999b) improves the efficiency by re- null ordering of feature encoding. A method (similar to the one introduced in Section 7) that uses pre-compiled rule filters is presented in (Kiefer et al., 1999), although the authors did not focus on the indexing potential of the static analysis of mother-daughter relations, nor present the indexing in a large experimental context.</Paragraph>
  </Section>
class="xml-element"></Paper>