<?xml version="1.0" standalone="yes"?>
<Paper uid="P99-1060">
  <Title>An Earley-style Predictive Chart Parsing Method for Lambek Grammars</Title>
  <Section position="2" start_page="0" end_page="0" type="intro">
    <SectionTitle>
1 Introduction
</SectionTitle>
    <Paragraph position="0"> We present a new chart parsing method for Lambek grammars. The starting point for this work is the observation, in (Hepple, 1998), of certain similarities between categorial grammars and the D-Tree grammar (DTG) formalism of Rambow et al. (1995a). On this basis, we have explored adapting the DTG parsing approach of Rambow et al. (1995b) for use with the Lambek calculus. The resulting method is one in which the formulae of a Lambek sequent that is to be proven are first converted to produce rules of a formalism which combines ideas from the multiset-valued linear indexed grammar formalism of Rainbow (1994), with the Lambek calculus span labelling scheme of Morrill (1995), and with the first-order compilation method for categorial parsing of Hepple (1996).</Paragraph>
    <Paragraph position="1"> The resulting 'grammar' is then parsed using an Earley-style predictive chart algorithm which is adapted from Rambow et al. (1995b).</Paragraph>
  </Section>
class="xml-element"></Paper>