<?xml version="1.0" standalone="yes"?>
<Paper uid="E99-1020">
  <Title>Tabular Algorithms for TAG Parsing</Title>
  <Section position="3" start_page="150" end_page="150" type="intro">
    <SectionTitle>
* Item refinement,
</SectionTitle>
    <Paragraph position="0"> multiple items.</Paragraph>
    <Paragraph position="1"> breaking single items into * Step refinement, decomposing a single deduction step in a sequence of steps. * Extension of a schema by considering a larger class of grammars.</Paragraph>
    <Paragraph position="2"> In order to decrease the number of items and deduction steps in a parsing schema, we can apply the following kinds of filtering:  duction steps is replaced by a single one. The set of items in a parsing system PAIg corresponding to the parsing schema Alg describing a given parsing algorithm Alg is denoted 2:Alg, the set of hypotheses 7/Alg, the set of final items ~'Alg and the set of deduction steps is denoted ~)Alg&amp;quot;</Paragraph>
  </Section>
class="xml-element"></Paper>