<?xml version="1.0" standalone="yes"?>
<Paper uid="P88-1032">
  <Title>AN EAR.LEY-TYPE PAR.SING ALGOR.ITHM FOR. TR.EE ADJOINING GR_kMMAR.S *</Title>
  <Section position="7" start_page="268" end_page="268" type="concl">
    <SectionTitle>
5 Conclusion
</SectionTitle>
    <Paragraph position="0"> We described an Earley-type parser for TAGs. We extended it to deal with substitution and feature structures for TAGs. By doing this, we have built a system that parses unification formalisms that have a CFG skeleton and also those that have a TAG skeleton. The system is being used for Tree Adjoining Grammar development (AbeiU~, 1988).</Paragraph>
    <Paragraph position="1"> This work has led us to a new general parsing strategy (Schabes, Abeill~ and Joshi, 1988) which allows us to construct a two-stage parser. In the first stage a subset of the elementary trees is extracted and in the second stage the sentence is parsed with respect to this subset. This strategy significantly improves performance, especially as the grammar size increases.</Paragraph>
  </Section>
class="xml-element"></Paper>