Andreas Maletti

• Tree Transducers in Machine Translation
  (DFG Projekt im Emmy Noether-Programm, Stuttgart, 2011-2016, ca. 1,2M EUR)
• Juan de la Cierva-Projekt (Ministerio de Educación y Cienca, Tarragona, 2008-2011, ca. 100k EUR)
• PostDoc-Projekt im ICSI Programm (DAAD, Berkeley, 2007-2008, ca. 30k EUR)

Sommersemester 2013 (in Stuttgart):

• Seminar Formal Models in Natural Language Processing
• Vorlesung Statistical Machine Translation

Wintersemester 2012/2013 (in Stuttgart):

• Vorlesung Tree Automata

Sommersemester 2012 (in Stuttgart):

• Seminar Formal Models in Natural Language Processing

Wintersemester 2011/2012 (in Stuttgart):

• Vorlesung Statistical Machine Translation (mit Alexander Fraser)

Sommersemester 2007 (in Dresden):

• Übung Syntax-directed Semantics
• Seminar Natürliche Sprachverarbeitung

Wintersemester 2006/2007 (in Dresden):

• Seminar Natürliche Sprachverarbeitung

In Zeitschriften — Bei Konferenzen — Technische Berichte — Studienarbeiten

In Zeitschriften 

• Hyper-minimization for deterministic tree automata
  (mit Artur Jeż)
  Int. J. Found. Comput. Sci., © World Scientific, 2013. — [ bib ]
• Unweighted and weighted hyper-minimization
  (mit Daniel Quernheim)
  Int. J. Found. Comput. Sci., 23(6):1207-1225, © World Scientific, 2012. — [ bib | http ]
• The category of simulations for weighted tree automata
  (mit Zoltán Ésik)
  Int. J. Found. Comput. Sci., 22(8):1845-1859, © World Scientific, 2011. — [ bib | http ]
• Optimal hyper-minimization
  (mit Daniel Quernheim)
  Int. J. Found. Comput. Sci., 22(8):1877-1891, © World Scientific, 2011. — [ bib | http | arXiv ]
• Part II: Application in machine translation of Survey: Weighted extended top-down tree transducers
  Fundam. Inform., 112(2-3):239-261, 2011. — [ bib | http ]
• Part I: Basics and expressive power of Survey: Weighted extended top-down tree transducers
  Acta Cybernet., 20(2):223-250, 2011. — [ bib | http ]
• Weighted extended tree transducers
  (mit Zoltán Fülöp und Heiko Vogler)
  Fundam. Inform., 111(2):163-202, 2011. — [ bib | http ]
• An alternative to synchronous tree substitution grammars
  Natural Language Engineering, 17(2):221-242, 2011. — [ bib | http ]
• An n log n algorithm for hyper-minimizing a (minimized) deterministic automaton
  (mit Markus Holzer)
  Theor. Comput. Sci., 411(38-39):3404-3413, 2010. — [ bib | http ]
• MAT learners for tree series — An abstract data type and two realizations
  (mit Frank Drewes und Johanna Högberg)
  Acta Inf., 48(3):165-189, © Springer-Verlag, 2011. — [ bib | http ]
• Properties of quasi-alphabetic tree bimorphisms
  (mit Cătălin Ionuţ Tîrnăucă)
  Int. J. Found. Comput. Sci., 21(3):257-276, © World Scientific, 2010. — [ bib | http | arXiv ]
• Extended multi bottom-up tree transducers — Composition and decomposition
  (mit Joost Engelfriet und Eric Lilin)
  Acta Inf., 46(8):561-590, © Springer-Verlag, 2009. — [ bib | http ]
• Minimizing deterministic weighted tree automata
  Inf. Comput., 207(11):1284-1299, 2009. — [ bib | http ]
• Bisimulation minimisation of weighted automata on unranked trees
  (mit Johanna Högberg und Heiko Vogler)
  Fundam. Inform., 92(1-2):103-130, 2009. — [ bib | http ]
• Backward and forward bisimulation minimization of tree automata
  (mit Johanna Högberg und Jonathan May)
  Theor. Comput. Sci., 410(37):3539-3552, 2009. — [ bib | http ]
• The power of extended top-down tree transducers
  (mit Jonathan Graehl, Mark Hopkins und Kevin Knight)
  SIAM J. Comput., 39(2):410-430, 2009. — [ bib | http ]
• Compositions of extended top-down tree transducers
  Inf. Comput., 206(9-10):1187-1196, 2008. — [ bib | http ]
• A Kleene theorem for weighted tree automata over distributive multioperator monoids
  (mit Zoltán Fülöp und Heiko Vogler)
  Theory Comput. Syst., 44(3):455-499, © Springer-Verlag, 2009. — [ bib | http ]
• Pure and o-substitution
  Int. J. Found. Comput. Sci., 18(4):829-845, © World Scientific, 2007. — [ bib | http ]
• Cut sets as recognizable tree languages
  (mit Björn Borchardt, Branimir Šešelja, Andreja Tepavčević und Heiko Vogler)
  Fuzzy Sets and Syst., 157(11):1560-1571, 2006. — [ bib | http ]
• Compositions of tree series transformations
  Theor. Comput. Sci., 366(3):248-271, 2006. — [ bib | http ]
• Incomparability results for classes of polynomial tree series transformations
  (mit Heiko Vogler)
  J. Autom. Lang. Combin., 10(4):535-568, 2005. — [ bib ]
• Relating tree series transducers and weighted tree automata
  Int. J. Found. Comput. Sci., 16(4):723-741, © World Scientific, 2005. — [ bib | http ]
• Hasse diagrams for classes of deterministic bottom-up tree-to-tree-series transformations
  Theor. Comput. Sci., 339(2-3):200-240, 2005. — [ bib | http ]
• Bounds for tree automata with polynomial costs
  (mit Björn Borchardt, Zoltán Fülöp und Zsolt Gazdag)
  J. Autom. Lang. Combin., 10(2-3):107-157, 2005. — [ bib ]

Bei Konferenzen

• Synchronous Forest Substitution Grammars
  Proc. 5th Int. Conf. Algebraic Informatics
  © Springer-Verlag, 2013. — [ bib ]
• Shallow local multi bottom-up tree transducers in statistical machine translation
  (mit Fabienne Braune, Daniel Quernheim und Nina Seemann)
  Proc. 51st Annual Meeting Association for Computational Linguistics
  © Association for Computational Linguistics, 2013. — [ bib ]
• Hyper-optimization for deterministic tree automata
  Proc. 18th Int. Conf. Implementation and Application of Automata
  Band 7982 von LNCS, Seiten 244-255. © Springer-Verlag, 2013. — [ bib ]
• Composition closure of ε-free linear extended top-down tree transducers
  (mit Zoltán Fülöp)
  Proc. 17th Int. Conf. Developments in Language Theory
  Band 7907 von LNCS, Seiten 239-251. © Springer-Verlag, 2013. — [ bib ]
• Unidirectional derivation semantics for synchronous tree-adjoining grammars
  (mit Matthias Büchse und Heiko Vogler)
  Proc. 16th Int. Conf. Developments in Language Theory
  Band 7410 von LNCS, Seiten 368-379. © Springer-Verlag, 2012. — [ bib | http | Folien ]
• 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 ]
• Strong lexicalization of tree adjoining grammars
  (mit Joost Engelfriet)
  Proc. 50th Annual Meeting Association for Computational Linguistics
  Seiten 506-515. © Association for Computational Linguistics, 2012. — [ bib | http | Folien ]
• Preservation of recognizability for weighted linear extended top-down tree transducers
  (mit Nina Seemann, Daniel Quernheim und Fabienne Braune)
  Proc. 2nd Workshop Applications of Tree Automata in Natural Language Processing
  Seiten 1-10. © Association for Computational Linguistics, 2012. — [ bib | http ]
• Composing extended top-down tree transducers
  (mit Aurélie Lagoutte, Fabienne Braune und Daniel Quernheim)
  Proc. 13th Int. Conf. European Chapter of the Association for Computational Linguistics
  Seiten 808-817. © Association for Computational Linguistics, 2012. — [ bib | http ]
• Hyper-minimization for deterministic tree automata
  (mit Artur Jeż)
  Proc. 17th Int. Conf. Implementation and Application of Automata
  Band 7381 von LNCS, Seiten 217-228. © Springer-Verlag, 2012. — [ bib | http | Folien ]
• Part III: Composition of Survey: Weighted extended top-down tree transducers (eingeladener Vortrag)
  (mit Aurélie Lagoutte)
  Proc. Workshop Algebraic Foundations in Computer Science
  Band 7020 von LNCS, Seiten 272-308. © Springer-Verlag, 2011. — [ bib | http | Folien ]
• 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 ]
• Pushing for weighted tree automata
  (mit Daniel Quernheim)
  Proc. 36th Int. Symp. Mathematical Foundations of Computer Science
  Band 6907 von LNCS, Seiten 460-471. © Springer-Verlag, 2011. — [ bib | http ]
• Computing all l-cover automata fast
  (mit Artur Jeż)
  Proc. 16th Int. Conf. Implementation and Application of Automata
  Band 6807 von LNCS, Seiten 203-214. © Springer-Verlag, 2011. — [ bib | http ]
• Notes on hyper-minimization (eingeladener Vortrag)
  Proc. 13th Int. Conf. Automata and Formal Languages
  Seiten 34-49. © Nyíregyháza College, 2011. — [ bib | Folien ]
• Hyper-minimisation of deterministic weighted finite automata over semifields
  (mit Daniel Quernheim)
  Proc. 13th Int. Conf. Automata and Formal Languages
  Seiten 285-299. © Nyíregyháza College, 2011. — [ bib | Folien ]
• 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 ]
• On minimising automata with errors
  (mit Paweł Gawrychowski und Artur Jeż)
  Proc. 36th Int. Symp. Mathematical Foundations of Computer Science
  Band 6907 von LNCS, Seiten 327-338. © Springer-Verlag, 2011. — [ bib | http | arXiv ]
• Survey: Tree transducers in machine translation (eingeladener Vortrag)
  Proc. 2nd Workshop Non-Classical Models of Automata and Applications
  Band 263 von books@ocg.at, Seiten 11-32. © Österreichische Computer Gesellschaft, 2010. — [ bib | Folien ]
• Input and output products for weighted extended top-down tree transducers
  Proc. 14th Int. Conf. Developments in Language Theory
  Band 6224 von LNCS, Seiten 316-327. © Springer-Verlag, 2010. — [ bib | http | Folien ]
• Simulations of weighted tree automata
  (mit Zoltán Ésik)
  Proc. 15th Int. Conf. Implementation and Application of Automata
  Band 6482 von LNCS, Seiten 321-330. © Springer-Verlag, 2011. — [ bib | http | arXiv | Folien ]
• Better hyper-minimization — not as fast, but fewer errors
  Proc. 15th Int. Conf. Implementation and Application of Automata
  Band 6482 von LNCS, Seiten 201-210. © Springer-Verlag, 2011. — [ bib | http | Folien ]
• Simulation vs. equivalence
  (mit Zoltán Ésik)
  Proc. 6th Int. Conf. Foundations of Computer Science
  Seiten 119-122. © CSREA Press, 2010. — [ bib | arXiv ]
• Preservation of recognizability for synchronous tree substitution grammars
  (mit Zoltán Fülöp und Heiko Vogler)
  Proc. 1st Workshop Applications of Tree Automata in Natural Language Processing
  Seiten 1-9. ©  Association for Computational Linguistics, 2010. — [ bib | http ]
• Parsing and translation algorithms based on weighted extended tree transducers
  (mit Giorgio Satta)
  Proc. 1st Workshop Applications of Tree Automata in Natural Language Processing
  Seiten 19-27. ©  Association for Computational Linguistics, 2010. — [ bib | http | Folien ]
• A tree transducer model for synchronous tree-adjoining grammars
  Proc. 48th Annual Meeting Association for Computational Linguistics
  Seiten 1067-1076. ©  Association for Computational Linguistics, 2010. — [ bib | http | Folien ]
• Why synchronous tree substitution grammars?
  Proc. 11th Conf. North American Chapter of the Association for Computational Linguistics
  Seiten 876-884. ©  Association for Computational Linguistics, 2010. — [ bib | http | Folien ]
• Parsing algorithms based on tree automata
  (mit Giorgio Satta)
  Proc. 11th Int. Conf. Parsing Technologies
  Seiten 1-12. ©  Association for Computational Linguistics, 2009. — [ bib | http | Folien ]
• An n log n algorithm for hyper-minimizing states in a (minimized) deterministic automaton
  (mit Markus Holzer)
  Proc. 14th Int. Conf. Implementation and Application of Automata
  Band 5642 von LNCS, Seiten 4-13. © Springer-Verlag, 2009. — [ bib | http ]
• Minimizing weighted tree grammars using simulation
  Proc. 8th Int. Workshop Finite-State Methods and Natural Language Processing
  Band 6062 von LNAI, Seiten 56-68. © Springer-Verlag, 2010. — [ bib | http | Folien ]
• Compositions of top-down tree transducers with ε-rules
  (mit Heiko Vogler)
  Proc. 8th Int. Workshop Finite-State Methods and Natural Language Processing
  Band 6062 von LNAI, Seiten 69-80. © Springer-Verlag, 2010. — [ bib | http | Folien ]
• Syntax-directed translations and quasi-alphabetic tree bimorphisms — revisited
  (mit Cătălin Ionuţ Tîrnăucă)
  Proc. 3rd Int. Conf. Algebraic Informatics
  Band a href="http://dx.doi.org/10.1007/978-3-642-03564-7" target="_blank">5725 von LNCS, Seiten 305-317. © Springer-Verlag, 2009. — [ bib | http ]
• A backward and a forward simulation for weighted tree automata
  Proc. 3rd Int. Conf. Algebraic Informatics
  Band 5725 von LNCS, Seiten 288-304. © Springer-Verlag, 2009. — [ bib | http | Folien ]
• Tree-series-to-tree-series transformations
  Proc. 13th Int. Conf. Implementation and Application of Automata
  Band 5148 von LNCS, Seiten 132-140. © Springer-Verlag, 2008. — [ bib | http | Folien ]
• Extended multi bottom-up tree transducers
  (mit Joost Engelfriet und Eric Lilin)
  Proc. 12th Int. Conf. Developments in Language Theory
  Band 5257 von LNCS, Seiten 289-300. © Springer-Verlag, 2008. — [ bib | http | Folien ]
• Minimizing deterministic weighted tree automata
  Proc. 2nd Int. Conf. Language and Automata Theory and Applications
  Band 5196 von LNCS, Seiten 357-372. © Springer-Verlag, 2008. — [ bib | http | Folien ]
• Myhill-Nerode theorem for recognizable tree series — revisited
  Proc. 8th Int. Conf. Latin American Theoretical Informatics
  Band 4957 von LNCS, Seiten 106-120. © Springer-Verlag, 2008. — [ bib | http | Folien ]
• Learning deterministically recognizable tree series revisited
  Proc. 2nd Int. Conf. Algebraic Informatics
  Band 4728 von LNCS, Seiten 218-235. © Springer-Verlag, 2007. — [ bib | http | Folien ]
• Bisimulation minimisation for weighted tree automata
  (mit Johanna Högberg und Jonathan May)
  Proc. 11th Int. Conf. Developments in Language Theory
  Band 4588 von LNCS, Seiten 229-241. © Springer-Verlag, 2007. — [ bib | http ]
• Myhill-Nerode theorem for recognizable tree series revisited
  Proc. 1st Int. Conf. AutoMathA: From Mathematics to Applications
  2007. — [ bib | Folien ]
• Backward and forward bisimulation minimisation of tree automata
  (mit Johanna Högberg und Jonathan May)
  Proc. 12th Int. Conf. Implementation and Application of Automata
  Band 4783 von LNCS, Seiten 109-121. © Springer-Verlag, 2007. — [ bib | http ]
• Compositions of extended top-down tree transducers
  Proc. 1st Int. Conf. Language and Automata Theory and Applications
  Bericht 35/07, Seiten 379-390. Universitat Rovira I Virgili. 2007. — [ bib | http | Folien ]
• Does o-substitution preserve recognizability?
  Proc. 11th Int. Conf. Implementation and Application of Automata
  Band 4094 von LNCS, Seiten 150-161. © Springer-Verlag, 2006. — [ bib | http | Folien ]
• The substitution vanishes
  (mit Armin Kühnemann)
  Proc. 11th Int. Conf. Algebraic Methodology and Software Technology
  Band 4019 von LNCS, Seiten 173-188. © Springer-Verlag, 2006. — [ bib | http | Anhang ]
• Hierarchies of tree series transformations revisited
  Proc. 10th Int. Conf. Developments in Language Theory
  Band 4036 von LNCS, Seiten 215-225. © Springer-Verlag, 2006. — [ bib | http | Folien ]
• The power of tree series transducers of type I and II
  Proc. 9th Int. Conf. Developments in Language Theory
  Band 3572 von LNCS, Seiten 338-349. © Springer-Verlag, 2005. — [ bib | http | Folien ]
• Compositions of bottom-up tree series transformations
  Proc. 11th Int. Conf. Automata and Formal Languages
  Seiten 187-199, 2005. — [ bib | Folien ]
• Myhill-Nerode theorem for sequential transducers over unique GCD-monoids
  Proc. 9th Int. Conf. Implementation and Application of Automata
  Band 3317 von LNCS, Seiten 323-324. © Springer-Verlag, 2004. — [ bib | http | Langversion | Poster ]
• Relating tree series transducers and weighted tree automata
  Proc. 8th Int. Conf. Developments in Language Theory
  Band 3340 von LNCS, Seiten 321-333. © Springer-Verlag, 2004. — [ bib | http | Folien ]

Technische Berichte

• MAT learners for tree series — An abstract data type and two realizations
  (mit Frank Drewes und Johanna Högberg)
  Technischer Bericht UMINF 09.22, Universität Umeå, 2009. — [ bib | http ]
• An n log n algorithm for hyper-minimizing states in a (minimized) deterministic automaton
  (mit Martin Holzer)
  IFIG Technischer Bericht 0902, Universität Giessen, 2009. — [ bib | http ]
• Bisimulation minimisation of weighted automata on unranked tree
  (mit Johanna Högberg und Heiko Vogler)
  Technischer Bericht TUD-FI08-03, Technische Universität Dresden, 2008. — [ bib | http ]
• Bisimulation minimisation of weighted tree automata
  (mit Johanna Högberg und Jonathan May)
  Technischer Bericht ISI-TR-634, University of Southern California, 2007. — [ bib | http ]
• Backward and forward bisimulation minimisation of tree automata
  (mit Johanna Högberg und Jonathan May)
  Technischer Bericht ISI-TR-633, University of Southern California, 2007. — [ bib | http ]
• Pure and o-substitution
  Technischer Bericht TUD-FI06-05, Technische Universität Dresden, 2006. — [ bib | http ]
• Compositions of tree series transformations
  Technischer Bericht TUD-FI05-05, Technische Universität Dresden, 2005. — [ bib | http ]
• Inclusion diagrams for classes of deterministic bottom-up tree-to-tree-series transformations
  Technischer Bericht TUD-FI04-07, Technische Universität Dresden, 2004. — [ bib | http ]
• Incomparability results for classes of polynomial tree series transformations
  (mit Heiko Vogler)
  Technischer Bericht TUD-FI03-14, Technische Universität Dresden, 2003. — [ bib | http ]

Studienarbeiten

• The power of tree series transducers
  Dissertation, Technische Universität Dresden, 2006. — [ bib | Vortrag | Verteidigung ]
• Direct construction and efficiency analysis for the accumulation technique of 2-modular tree transducers
  Diplomarbeit, Technische Universität Dresden, 2002. — [ bib | Verteidigung ]
• Efficiency analysis for the elimination of intermediate results in functional programs by composition of attributed tree transducers
  Bakkalaureatsarbeit, Technische Universität Dresden, 2001. — [ bib | Verteidigung ]

Unter "http" ist immer die offizielle Version des Verlegers erreichbar.

laufend:

• Fabienne Braune, M.Sc. (Informatik) und M.A. (franz. Linguistik), Doktorandin (Dr. rer. nat.)
• Daniel Quernheim, Diplom-Sprachwissenschaftler, Doktorand (Dr. phil.)
• Nina Seemann, Diplom-Linguistin, Doktorandin (Dr. phil.)

abgeschlossen:

• Carmen Heger, Dipl.-Inf., Projekt (Dresden)
• Ronny Herzog, Dipl.-Inf., Beleg (Dresden)
• Robin Kurtz, B.Sc., Bachelorarbeit (Stuttgart)
• Lena Morgenroth, Dipl.-Inf., Beleg (Dresden)
• Daniel Quernheim, Dipl.-Sprachwissenschaftler, Diplomarbeit (Potsdam)

		1978	Geburt

		1985-1997	Vitzthum Gymnasium Dresden (Leistungskurse: Mathematik und Englisch)

		1997-1998	Grundwehrdienst

		1998-2001	Bakkalaureus in Informatik (Bakk. Inf.) an der TU Dresden [ Bakkalaureatsarbeit ]

		2001-2002	Diplom in Informatik (Dipl.-Inf.) an der TU Dresden [ Diplomarbeit ]

		2003-2006	Promotion (Dr. rer. nat.) im Graduiertenkolleg 334 [ Dissertation ]

		2006-2008	wissenschaftlicher Mitarbeiter der Fakultät Informatik der TU Dresden (2007-2008 beurlaubt)

		2007-2008	Postdoktorand am ICSI in Berkeley, CA, USA (Sponsor: DAAD)

		2008-2011	Juan de la Cierva-Nachwuchswissenschaftler an der URV in Tarragona, Spanien (Sponsor: Ministerio de Educación y Cienca)

		2011-2016	Projektleiter im Emmy Noether-Programm am Institut für Maschinelle Sprachverarbeitung der Universität Stuttgart (Sponsor: DFG)