<?xml version="1.0" standalone="yes"?>
<Paper uid="W06-1521">
  <Title>Parsing TAG with Abstract Categorial Grammar</Title>
  <Section position="8" start_page="144" end_page="144" type="concl">
    <SectionTitle>
6 Conclusion and perspective
</SectionTitle>
    <Paragraph position="0"> In this paper, we have illustrated the use for TAGs of general and abstract tools, syntactic descriptions, which can be used to parse linear l-terms.</Paragraph>
    <Paragraph position="1"> Even though ACGs are very general in their definition, the algorithm we describe shows that this generality is not a source of unefficiency. Indeed, this algorithm, a special instance of a general one which can parse any second order ACG and it behaves exactly the same way as the algorithm given by (Schabes and Joshi, 1988) so that it parses a second order ACG encoding a TAG in O(n6).</Paragraph>
    <Paragraph position="2"> The technique used enables to see generation as parsing. In the framework of second order ACG, the logical formulae on which generation is performed are bound to be obtained from semantic recipies coded with linear l-terms and are therefore not really adapted to Montague semantics. Nevertheless, syntactic descriptions can be extended with intersection types (Dezani-Ciancaglini et al., 2005) in order to cope with simply typed lcalculus. With this extension, it seems possible to extend the algorithm for second order ACGs so that it can deal with simply typed l-terms and without loosing its efficiency in the linear case.</Paragraph>
  </Section>
class="xml-element"></Paper>