Training tree transducers

  • Graehl J
  • Knight K
  • May J
  • 78


    Mendeley users who have this article in their library.
  • 42


    Citations of this article.


Many probabilistic models for natural language are now written in terms of hierarchical tree structure. Tree-based modeling still lacks many of the standard tools taken for granted in (finite-state) string-based modeling. The theory of tree transducer automata provides a possible framework to draw on, as it has been worked out in an extensive literature. We motivate the use of tree transducers for natural language and address the training problem for probabilistic tree-to-tree and tree-to-string transducers.

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document


  • Jonathan Graehl

  • Kevin Knight

  • Jonathan May

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free