<?xml version="1.0" standalone="yes"?>
<Paper uid="E06-2005">
  <Title>XMG - An expressive formalism for describing tree-based grammars</Title>
  <Section position="5" start_page="105" end_page="105" type="evalu">
    <SectionTitle>
4 Evaluation
</SectionTitle>
    <Paragraph position="0"> The XMG system has been successfully used by linguists todevelop acore TAG for French containing more than 6.000 trees. This grammar has been evaluated on the TSNLP test-suite, with a coverage rate of 75 % (see (Crabb'e, 2005)). The meta-grammar used toproduce that grammar consists of 290 classes and is compiled by the XMG system in about 16 minutes with a Pentium 4, 2.6 GHz and 1 GB of RAM.7 XMG has also been used to produce a core size Interaction Grammar for French (see (Perrier, 2003)).</Paragraph>
    <Paragraph position="1">  straint solving takes about 12 min. Of course, subsets of the grammar may be rebuilt separately.</Paragraph>
    <Paragraph position="2"> Finally, XMG is currently used to develop a TAG that includes a semantic dimension along the line described in (Gardent and Kallmeyer, 2003).</Paragraph>
  </Section>
class="xml-element"></Paper>