Nachwuchsgruppe Tree Transducers in Machine Translation

Dr. Andreas Maletti war von 2011 bis 2016 Projektleiter der Emmy-Noether-Gruppe "Tree Transducers in Machine Translation" am Institut für maschinelle Sprachverarbeitung.

Prof. Dr. Andreas Maletti ist nun Leiter der Abteilung Algebraische und logische Grundlagen der Informatik an der Universität Leipzig.

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

 In Zeitschriften — Bei Konferenzen
 

In Zeitschriften

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

Bei Konferenzen

•  Daniel Quernheim and Kevin Knight. Dagger: A toolkit for automata on directed acyclic graphs. In Proc. 10th Int. Workshop Finite-State Methods and Natural Language Processing. © Association for Computational Linguistics, 2012. [ bib | pdf ]
•  Daniel Quernheim and Kevin Knight. Towards probabilistic acceptors and transducers for feature structures. In Marine Carpuat, Lucia Specia, and Dekai Wu, editors, Proc. 6th Workshop Syntax, Semantics and Structure in Statistical Translation, pages 76–85. © Association for Computational Linguistics, 2012. [ bib | pdf ]
•  Artur Jeż and Andreas Maletti. Hyper-minimization for deterministic tree automata. In Nelma Moreira and Rogério Reis, editors,Proc. 17th Int. Conf. Implementation and Application of Automata, volume 7381 of LNCS, pages 217–228. Springer, 2012. [ bib | pdf ]
•  Matthias Büchse, Andreas Maletti, and Heiko Vogler. Unidirectional derivation semantics for synchronous tree-adjoining grammars. In Hsu-Chun Yen and Oscar H. Ibarra, editors, Proc. 16th Int. Conf. Developments in Language Theory, volume 7410 of LNCS, pages 368–379. Springer, 2012. [ bib | pdf ]
•  Andreas Maletti and Joost Engelfriet. Strong lexicalization of tree adjoining grammars. In Proc. 50th Annual Meeting Association for Computational Linguistics. © Association for Computational Linguistics, 2012. (to appear). [ bib | pdf ]
•  Andreas Maletti. Every sensible extended top-down tree transducer is a multi bottom-up tree transducer. In Eric Fosler-Lussier, Ellen Riloff, and Srinivas Bangalore, editors, Proc. 12th Int. Conf. North American Chapter of the Association for Computational Linguistics, pages 263–273. © Association for Computational Linguistics, 2012. [ bib | pdf ]
•  Nina Seemann, Daniel Quernheim, Fabienne Braune, and Andreas Maletti. Preservation of recognizability for weighted linear extended top-down tree transducers. In Frank Drewes and Marco Kuhlmann, editors, Proc. 2nd Workshop Applications of Tree Automata in Natural Language Processing, pages 1–10. © Association for Computational Linguistics, 2012. [ bib | pdf ]
•  Aurélie Lagoutte, Fabienne Braune, Daniel Quernheim, and Andreas Maletti. Composing extended top-down tree transducers. In Proc. 13th Int. Conf. European Chapter of the Association for Computational Linguistics, pages 808–817. © Association for Computational Linguistics, 2012. [ bib | pdf ]
•  Aurélie Lagoutte and Andreas Maletti. Survey: Weighted extended top-down tree transducers — Part III: Composition. In Werner Kuich and George Rahonis, editors, Proc. Workshop Algebraic Foundations in Computer Science, volume 7020 ofLNCS, pages 272–308. © Springer-Verlag, 2011. [ bib | http | pdf ]
•  Andreas Maletti. Tree transformations and dependencies. In Makoto Kanazawa, Markus Kracht, and Hiroyuki Seki, editors,Proc. 12th Meeting Mathematics of Language, volume 6878 of LNAI, pages 1–20. © Springer-Verlag, 2011. [ bib | http | pdf ]
•  Andreas Maletti. Notes on hyper-minimization. In Pál Dömösi and Szabolcs Iván, editors, Proc. 13th Int. Conf. Automata and Formal Languages, pages 34–49. © Nyíregyháza College, 2011. [ bib | pdf ]
•  Andreas Maletti and Daniel Quernheim. Pushing for weighted tree automata. In Filip Murlak and Piotr Sankowski, editors,Proc. 36th Int. Conf. Mathematical Foundations of Computer Science, volume 6907 of LNCS, pages 460–471. © Springer-Verlag, 2011. [ bib | http | pdf ]
•  Artur Jeż and Andreas Maletti. Computing all l-cover automata fast. In Béatrice Bouchou-Markhoff, Pascal Caron, Jean-Marc Champarnaud, and Denis Maurel, editors, Proc. 16th Int. Conf. Implementation and Application of Automata, volume 6807 ofLNCS, pages 203–214. © Springer-Verlag, 2011. [ bib | http | pdf ]
•  Andreas Maletti and Daniel Quernheim. Hyper-minimisation of deterministic weighted finite automata over semifields. In Pál Dömösi and Szabolcs Iván, editors, Proc. 13th Int. Conf. Automata and Formal Languages, pages 285–299. © Nyíregyháza College, 2011. [ bib | pdf ]
•  Pawel Gawrychowski, Artur Jeż, and Andreas Maletti. On minimising automata with errors. In Filip Murlak and Piotr Sankowski, editors, Proc. 36th Int. Conf. Mathematical Foundations of Computer Science, volume 6907 of LNCS, pages 327–338. © Springer-Verlag, 2011. [ bib | arXiv | pdf ]
•  Andreas Maletti. How to train your multi bottom-up tree transducer. In Yuji Matsumoto and Rada Mihalcea, editors, Proc. 49th Annual Meeting Association for Computational Linguistics, pages 825–834. © Association for Computational Linguistics, 2011. [ bib | http | pdf ]