Project TT in MT

Firstly, we would like to develop an adequate translation model for syntax-based machine translation together with the basic algorithms that operate on it. This research effort should culminate in a competetive and publicly available toolkit that implements this translation model. Secondly, we would like to generalize the existing machine translation technology to fully support a syntax-based approach. This includes the development of tree-to-tree alignments, tree-based metrics, and syntax-based features. To illustrate the applicability of our results, we will develop a syntax-based translation system based on our toolkit.

The advent of syntax-based machine translation of natural languages sparked renewed interest in formal models for tree languages and tree transformations. Tree automata and tree transducers are finite-state models that compute such languages and transformations. Several unweighted and weighted types exist, however no known model is adequate for the development of an efficient toolkit for syntax-based machine translation. This is due to the fact that the existing models are either not expressive enough or do not have the essential properties (like closure under composition or preservation of regularity) that are required for the use in a toolkit. In this respect, the situation is dramatically different from the areas of word- or phrase-based translation systems, for which toolkits based on finite-state string transducers are the de-facto implementation standard.

The project has two main goals. Firstly, we would like to develop an adequate translation model for syntax-based machine translation together with the basic algorithms that operate on it. This research effort should culminate in a competetive and publicly available toolkit that implements this translation model. Secondly, we would like to generalize the existing machine translation technology to fully support a syntax-based approach. This includes the development of tree-to-tree alignments, tree-based metrics, and syntax-based features. To illustrate the applicability of our results, we will develop a syntax-based translation system based on our toolkit.

• Fabienne Braune
• Aurélie Lagoutte (Sommerpraktikantin 2011)
• Dr. Andreas Maletti
• Daniel Quernheim
• Nina Seemann

In journals

• Artur Jeż und Andreas Maletti
  Hyper-minimization for deterministic tree automata
  Int. J. Found. Comput. Sci. , © World Scientific, 2013.
  — [ bib ]
• Andreas Maletti und Daniel Quernheim
  Unweighted and weighted hyper-minimization
  Int. J. Found. Comput. Sci., 23(6):1207-1225, © World Scientific, 2012.
  — [ bib | http ]
• Zoltán Ésik und Andreas Maletti
  The category of simulations for weighted tree automata
  Int. J. Found. Comput. Sci., 22(8):1845-1859, © World Scientific, 2011.
  — [ bib | http ]
• Andreas Maletti und Daniel Quernheim
  Optimal hyper-minimization
  Int. J. Found. Comput. Sci., 22(8):1877-1891, © World Scientific, 2011.
  — [ bib | http | arXiv ]
• Andreas Maletti
  Part II: Application in machine translation of Survey: Weighted extended top-down tree transducers
  Fundam. Inform., 112(2-3):239-261, 2011.
  — [ bib | http ]
• Andreas Maletti
  Part I: Basics and expressive power of Survey: Weighted extended top-down tree transducers
  Acta Cybernet., 20(2):223-250, 2011.
  — [ bib | http ]

At conferences

• Zoltán Fülöp und Andreas Maletti
  Composition closure of ε-free linear extended top-down tree transducers
  Proc. 17th Int. Conf. Developments in Language Theory
  © Springer-Verlag, 2013.
  — [ bib ]
• Matthias Büchse, Andreas Maletti und Heiko Vogler
  Unidirectional derivation semantics for synchronous tree-adjoining grammars
  Proc. 16th Int. Conf. Developments in Language Theory
  Band 7410 von LNCS, Seiten 368-379. © Springer-Verlag, 2012.
  — [ bib | http | Folien ]
• Andreas Maletti
  Every sensible extended top-down tree transducer is a multi bottom-up tree transducer
  Proc. 12th Conf. North American Chapter of the Association for Computational Linguistics
  Seiten 263-273. © Association for Computational Linguistics, 2012.
  — [ bib | http | Poster ]
• Joost Engelfriet und Andreas Maletti
  Strong lexicalization of tree adjoining grammars
  Proc. 50th Annual Meeting Association for Computational Linguistics
  Seiten 506-515. © Association for Computational Linguistics, 2012.
  — [ bib | http | Folien ]
• Fabienne Braune, Andreas Maletti, Daniel Quernheim und Nina Seemann
  Preservation of recognizability for weighted linear extended top-down tree transducers
  Proc. 2nd Workshop Applications of Tree Automata in Natural Language Processing
  Seiten 1-10. © Association for Computational Linguistics, 2012.
  — [ bib | http ]
• Fabienne Braune, Aurélie Lagoutte, Andreas Maletti und Daniel Quernheim
  Composing extended top-down tree transducers
  Proc. 13th Int. Conf. European Chapter of the Association for Computational Linguistics
  Seiten 808-817. © Association for Computational Linguistics, 2012.
  — [ bib | http ]
• Artur Jeż und Andreas Maletti
  Hyper-minimization for deterministic tree automata
  Proc. 17th Int. Conf. Implementation and Application of Automata
  Band 7381 von LNCS, Seiten 217-228. © Springer-Verlag, 2012.
  — [ bib | http | Folien ]
• Aurélie Lagoutte und Andreas Maletti
  Part III: Composition of Survey: Weighted extended top-down tree transducers (eingeladener Vortrag)
  Proc. Workshop Algebraic Foundations in Computer Science
  Band 7020 von LNCS, Seiten 272-308. © Springer-Verlag, 2011.
  — [ bib | http | Folien ]
• Andreas Maletti
  Tree transformations and dependencies (eingeladener Vortrag)
  Proc. 12th Meeting Mathematics of Language
  Band 6878 von LNAI, Seiten 1-20. © Springer-Verlag, 2011.
  — [ bib | http | Folien ]
• Andreas Maletti und Daniel Quernheim
  Pushing for weighted tree automata
  Proc. 36th Int. Symp. Mathematical Foundations of Computer Science
  Band 6907 von LNCS, Seiten 460-471. © Springer-Verlag, 2011.
  — [ bib | http ]
• Artur Jeż und Andreas Maletti
  Computing all l-cover automata fast
  Proc. 16th Int. Conf. Implementation and Application of Automata
  Band 6807 von LNCS, Seiten 203-214. © Springer-Verlag, 2011.
  — [ bib | http ]
• Andreas Maletti
  Notes on hyper-minimization (eingeladener Vortrag)
  Proc. 13th Int. Conf. Automata and Formal Languages
  Seiten 34-49. © Nyíregyháza College, 2011.
  — [ bib | Folien ]
• Andreas Maletti und Daniel Quernheim
  Hyper-minimisation of deterministic weighted finite automata over semifields
  Proc. 13th Int. Conf. Automata and Formal Languages
  Seiten 285-299. © Nyíregyháza College, 2011.
  — [ bib | Folien ]
• Andreas Maletti
  How to train your multi bottom-up tree transducer
  Proc. 49th Annual Meeting Association for Computational Linguistics
  Seiten 825-834. © Association for Computational Linguistics, 2011.
  — [ bib | http | Folien ]
• Paweł Gawrychowski, Artur Jeż und Andreas Maletti
  On minimising automata with errors
  Proc. 36th Int. Symp. Mathematical Foundations of Computer Science
  Band 6907 von LNCS, Seiten 327-338. © Springer-Verlag, 2011.
  — [ bib | http | arXiv ]