<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<item>
  <id>05916694</id>
  <dt>a</dt>
  <an>05916694</an>
  <augroup>
    <au>Sandillon-Rezer, No\'emie-Fleur</au>
    <au>Moot, Richard</au>
  </augroup>
  <ti>Using tree transducers for grammatical inference.</ti>
  <so>Pogodalla, Sylvain (ed.) et al., Logical aspects of computational linguistics. 6th international conference, LACL 2011, Montpellier, France, June 29 -- July 1, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-22220-7/pbk). Lecture Notes in Computer Science 6736. Lecture Notes in Artificial Intelligence, 235-250 (2011).</so>
  <py>2011</py>
  <pu>Berlin: Springer</pu>
  <lagroup>
    <la>EN</la>
  </lagroup>
  <ccgroup>
  </ccgroup>
  <utgroup>
  </utgroup>
  <cigroup>
  </cigroup>
  <ligroup>
    <li>doi:10.1007/978-3-642-22221-4_16</li>
  </ligroup>
  <abgroup>
    <ab>Summary: We present a novel way of extracting a categorial grammar from annotated data. Using the sentences from the Paris VII annotated treebank [2] as our starting point, we use a tree transducer to convert the annotated trees from the corpus into categorial grammar derivations. We describe both the formal aspects and the implementation of the tree transducer, which is a conservative extension of standard tree transducers allowing a compact specification of the transductions rules relevant for our purposes, and we discuss the specific set of transduction rules we use to convert the corpus into AB grammar derivation trees. Evaluating the resulting tree transducer on the entire corpus, we find that it produces a treebank finds lexical entries for 90,0\% of the corpus, though it produces complete derivations for only 75\% of all sentence in the corpus.</ab>
    <rv></rv>
  </abgroup>
</item>