<?xml version="1.0" standalone="yes"?>
<Paper uid="W05-1522">
  <Title>Vancouver, October 2005. c(c)2005 Association for Computational Linguistics From Metagrammars to Factorized TAG/TIG Parsers</Title>
  <Section position="7" start_page="190" end_page="190" type="concl">
    <SectionTitle>
5 Evaluation
</SectionTitle>
    <Paragraph position="0"> The resulting French grammar has been compiled, with DYALOG, into an hybrid TAG/TIG parser, by identifying the left and right auxiliary insertion trees. Following a left-to-right top-down tabular parsing strategy, the parser may be used to get either full or partial parses.2 Coverage rate for full parsing is around 95% for two test suites (EURO-TRA and TSNLP) and around 42% on various corpora (including more than 300K sentences of a raw journalistic corpus).</Paragraph>
    <Paragraph position="1"> Our MG is still very young and needs to be improved to ensure a better coverage. However, we can already conclude that coupling MGs with factorized trees is a generic and powerful approach to control the size of grammars and to get efficient parsers.</Paragraph>
    <Paragraph position="2"> The various tools and linguistic resources mentioned in this abstract are freely available at http: //atoll.inria.fr/.</Paragraph>
  </Section>
class="xml-element"></Paper>