Andreas Maletti

ORCID

Publication Activity (10 Years)

Years Active: 2004-2024
Publications (10 Years): 34

Top Venues

CoRR

Int. J. Found. Comput. Sci.

DLT

CIAA

Dresden University of Technology (PHD)

Education History

Dresden University of Technology

PHD

Publications

Andreas Maletti
Compositions of Weighted Extended Tree Transducers - The Unambiguous Case. Int. J. Found. Comput. Sci. 35 (1&2) (2024)
Andreas Maletti, Andreea-Teodora Nász, Erik Paul
Weighted HOM-Problem for Nonnegative Integers. STACS (2024)
Andreas Maletti, Andreea-Teodora Nász
Weighted Tree Automata with Constraints. Theory Comput. Syst. 68 (1) (2024)
Fan Feng, Andreas Maletti
Weighted two-way transducers. Inf. Comput. 295 (Part B) (2023)
Andreas Maletti, Andreea-Teodora Nász, Erik Paul
Weighted HOM-Problem for Nonnegative Integers. CoRR (2023)
Andreas Maletti, Andreea-Teodora Nász
Weighted Bottom-Up and Top-Down Tree Transformations Are Incomparable. CIAA (2023)
Andreas Maletti, Teodora Nasz, Kevin Stier, Markus Ulbricht
Ambiguity Hierarchies for Weighted Tree Automata. Int. J. Found. Comput. Sci. 34 (8) (2023)
Andreas Maletti, Nils Oskar Nuernbergk
Pumping Lemmata for Recognizable Weighted Languages over Artinian Semirings. AFL (2023)
Andreas Maletti, Andreea-Teodora Nász
Weighted Tree Automata with Constraints. CoRR (2023)
Malte Blattmann, Andreas Maletti
Compositions with Constant Weighted Extended Tree Transducers. Int. J. Found. Comput. Sci. 34 (6) (2023)
Andreas Maletti, Lena Katharina Schiffer
Combinatory categorial grammars as generators of weighted forests. Inf. Comput. 294 (2023)
Manfred Droste, Andreas Maletti, Heiko Vogler
Preface. Inf. Comput. 282 (2022)
Fan Feng, Andreas Maletti
Weighted Two-Way Transducers. CAI (2022)
Marco Kuhlmann, Andreas Maletti, Lena Katharina Schiffer
The tree-generative capacity of combinatory categorial grammars. J. Comput. Syst. Sci. 124 (2022)
Andreas Maletti, Andreea-Teodora Nász
Weighted Tree Automata with Constraints. DLT (2022)
Andreas Maletti, Lena Katharina Schiffer
Strong Equivalence of TAG and CCG. CoRR (2022)
Malte Blattmann, Andreas Maletti
Compositions of Constant Weighted Extended Tree Transducers. DLT (2021)
Andreas Maletti, Teodora Nasz, Kevin Stier, Markus Ulbricht
Ambiguity Hierarchies for Weighted Tree Automata. CIAA (2021)
Lena Katharina Schiffer, Andreas Maletti
Strong Equivalence of TAG and CCG. Trans. Assoc. Comput. Linguistics 9 (2021)
Andreas Maletti, Kevin Stier
On Tree Substitution Grammars. DLT (2020)
Zoltán Fülöp, Andreas Maletti
Composition Closure of Linear Weighted Extended Top-Down Tree Transducers. CIAA (2019)
Marco Kuhlmann, Andreas Maletti, Lena Katharina Schiffer
The Tree-Generative Capacity of Combinatory Categorial Grammars. FSTTCS (2019)
Yining Chen, Sorcha Gilroy, Andreas Maletti, Jonathan May, Kevin Knight
Recurrent Neural Networks as Weighted Language Recognizers. NAACL-HLT (2018)
Joost Engelfriet, Andreas Maletti, Sebastian Maneth
Multiple context-free tree grammars: Lexicalization and characterization. Theor. Comput. Sci. 728 (2018)
Thomas Hanneforth, Andreas Maletti, Daniel Quernheim
Pushing for weighted tree automata. Log. Methods Comput. Sci. 14 (1) (2018)
Andreas Maletti
Compositions of Tree-to-Tree Statistical Machine Translation Models. Int. J. Found. Comput. Sci. 29 (5) (2018)
Andreas Maletti
Synchronous Forest Substitution Grammars. Acta Cybern. 23 (1) (2017)
Thomas Hanneforth, Andreas Maletti, Daniel Quernheim
Pushing for weighted tree automata. CoRR (2017)
Joost Engelfriet, Andreas Maletti
Multiple Context-Free Tree Grammars and Multi-component Tree Adjoining Grammars. FCT (2017)
Andreas Maletti
Survey: Finite-state technology in natural language processing. Theor. Comput. Sci. 679 (2017)
Joost Engelfriet, Zoltán Fülöp, Andreas Maletti
Composition Closure of Linear Extended Top-down Tree Transducers. Theory Comput. Syst. 60 (2) (2017)
Joost Engelfriet, Andreas Maletti, Sebastian Maneth
Multiple Context-Free Tree Grammars: Lexicalization and Characterization. CoRR (2017)
Zoltán Fülöp, Andreas Maletti
Linking theorems for tree transducers. J. Comput. Syst. Sci. 82 (7) (2016)
Andreas Maletti
Compositions of Tree-to-Tree Statistical Machine Translation Models. DLT (2016)
Andreas Maletti
Hyper-optimization for deterministic tree automata. Theor. Comput. Sci. 578 (2015)
Andreas Maletti
Extended Tree Transducers in Natural Language Processing. FSMNLP (2015)
Andreas Maletti
The Power of Weighted Regularity-Preserving Multi Bottom-Up Tree Transducers. Int. J. Found. Comput. Sci. 26 (7) (2015)
Nina Seemann, Fabienne Braune, Andreas Maletti
String-to-Tree Multi Bottom-up Tree Transducers. ACL (1) (2015)
Nina Seemann, Fabienne Braune, Andreas Maletti
A systematic evaluation of MBOT in statistical machine translation. MTSummit (2015)
Nina Seemann, Andreas Maletti
Discontinuous Statistical Machine Translation with Target-Side Dependency Syntax. WMT@EMNLP (2015)
Andreas Maletti
The Power of Regularity-Preserving Multi Bottom-up Tree Transducers. CIAA (2014)
Harry Bunt, Andreas Maletti, Joakim Nivre
Grammars, Parsers and Recognizers. J. Log. Comput. 24 (2) (2014)
Junfei Guo, Juan Liu, Qi Han, Andreas Maletti
A tunable language model for statistical machine translation. AMTA (2014)
Andreas Maletti, Daniel Quernheim
Hyper-Minimization for Deterministic Weighted Tree Automata. AFL (2014)
Robin Kurtz, Nina Seemann, Fabienne Braune, Andreas Maletti
DIMwid - Decoder Inspection for Moses (using Widgets). Prague Bull. Math. Linguistics 100 (2013)
Zoltán Fülöp, Andreas Maletti
Composition Closure of ε-Free Linear Extended Top-Down Tree Transducers. Developments in Language Theory (2013)
Andreas Maletti
Synchronous Forest Substitution Grammars. CAI (2013)
Zoltán Fülöp, Andreas Maletti
Composition Closure of Linear Extended Top-down Tree Transducers CoRR (2013)
Fabienne Braune, Nina Seemann, Daniel Quernheim, Andreas Maletti
Shallow Local Multi-Bottom-up Tree Transducers in Statistical Machine Translation. ACL (1) (2013)
Thomas Hanneforth, Andreas Maletti, Daniel Quernheim
Random Generation of Nondeterministic Finite-State Tree Automata. TTATT (2013)
Artur Jez, Andreas Maletti
Hyper-Minimization for Deterministic Tree Automata. Int. J. Found. Comput. Sci. 24 (6) (2013)
Andreas Maletti
Hyper-optimization for Deterministic Tree Automata. CIAA (2013)
Nina Seemann, Daniel Quernheim, Fabienne Braune, Andreas Maletti
Preservation of Recognizability for Weighted Linear Extended Top-Down Tree Transducers. ATANLP@EACL (2012)
Matthias Büchse, Andreas Maletti, Heiko Vogler
Unidirectional Derivation Semantics for Synchronous Tree-Adjoining Grammars. Developments in Language Theory (2012)
Andreas Maletti
Every sensible extended top-down tree transducer is a multi bottom-up tree transducer. HLT-NAACL (2012)
Andreas Maletti, Daniel Quernheim
Unweighted and Weighted Hyper-Minimization. Int. J. Found. Comput. Sci. 23 (6) (2012)
Andreas Maletti, Joost Engelfriet
Strong Lexicalization of Tree Adjoining Grammars. ACL (1) (2012)
Aurélie Lagoutte, Fabienne Braune, Daniel Quernheim, Andreas Maletti
Composing extended top-down tree transducers. EACL (2012)
Artur Jez, Andreas Maletti
Hyper-minimization for Deterministic Tree Automata. CIAA (2012)
Andreas Maletti
Survey: Weighted Extended Top-down Tree Transducers Part II - Application in Machine Translation. Fundam. Informaticae 112 (2-3) (2011)
Artur Jez, Andreas Maletti
Computing All ℓ-Cover Automata Fast. CIAA (2011)
Andreas Maletti
Tree Transformations and Dependencies. MOL (2011)
Andreas Maletti, Daniel Quernheim
Optimal Hyper-Minimization. Int. J. Found. Comput. Sci. 22 (8) (2011)
Andreas Maletti, Daniel Quernheim
Optimal Hyper-Minimization CoRR (2011)
Frank Drewes, Johanna Högberg, Andreas Maletti
MAT learners for tree series: an abstract data type and two realizations. Acta Informatica 48 (3) (2011)
Zoltán Fülöp, Andreas Maletti, Heiko Vogler
Weighted Extended Tree Transducers. Fundam. Informaticae 111 (2) (2011)
Pawel Gawrychowski, Artur Jez, Andreas Maletti
On minimising automata with errors CoRR (2011)
Andreas Maletti
Survey: Weighted Extended Top-down Tree Transducers Part I - Basics and Expressive Power. Acta Cybern. 20 (2) (2011)
Andreas Maletti
How to train your multi bottom-up tree transducer. ACL (2011)
Pawel Gawrychowski, Artur Jez, Andreas Maletti
On Minimising Automata with Errors. MFCS (2011)
Aurélie Lagoutte, Andreas Maletti
Survey: Weighted Extended Top-Down Tree Transducers Part III - Composition. Algebraic Foundations in Computer Science (2011)
Andreas Maletti, Daniel Quernheim
Pushing for Weighted Tree Automata. MFCS (2011)
Andreas Maletti
Notes on Hyper-minimization. AFL (2011)
Zoltán Ésik, Andreas Maletti
The Category of Simulations for Weighted Tree Automata. Int. J. Found. Comput. Sci. 22 (8) (2011)
Andreas Maletti
An alternative to synchronous tree substitution grammars. Nat. Lang. Eng. 17 (2) (2011)
Andreas Maletti, Daniel Quernheim
Hyper-minimisation of deterministic weighted finite automata over semifields. AFL (2011)
Markus Holzer, Andreas Maletti
An nlogn algorithm for hyper-minimizing a (minimized) deterministic automaton. Theor. Comput. Sci. 411 (38-39) (2010)
Andreas Maletti, Giorgio Satta
Parsing and Translation Algorithms Based on Weighted Extended Tree Transducers. ATANLP@ACL 2010 (2010)
Andreas Maletti
Survey: Tree Transducers in Machine Translation. NCMA (2010)
Zoltán Ésik, Andreas Maletti
Simulation vs. Equivalence. FCS (2010)
Zoltán Ésik, Andreas Maletti
Simulation vs. Equivalence CoRR (2010)
Zoltán Ésik, Andreas Maletti
Simulations of Weighted Tree Automata CoRR (2010)
Andreas Maletti
Better Hyper-minimization - Not as Fast, But Fewer Errors. CIAA (2010)
Zoltán Fülöp, Andreas Maletti, Heiko Vogler
Preservation of Recognizability for Synchronous Tree Substitution Grammars. ATANLP@ACL 2010 (2010)
Andreas Maletti
Why Synchronous Tree Substitution Grammars? HLT-NAACL (2010)
Andreas Maletti, Catalin Ionut Tîrnauca
Properties of Quasi-Relabeling Tree Bimorphisms. Int. J. Found. Comput. Sci. 21 (3) (2010)
Andreas Maletti
Input Products for Weighted Extended Top-Down Tree Transducers. Developments in Language Theory (2010)
Zoltán Ésik, Andreas Maletti
Simulations of Weighted Tree Automata. CIAA (2010)
Andreas Maletti
A Tree Transducer Model for Synchronous Tree-Adjoining Grammars. ACL (2010)
Andreas Maletti
Minimizing deterministic weighted tree automata. Inf. Comput. 207 (11) (2009)
Johanna Högberg, Andreas Maletti, Heiko Vogler
Bisimulation Minimisation of Weighted Automata on Unranked Trees. Fundam. Informaticae 92 (1-2) (2009)
Andreas Maletti
A Backward and a Forward Simulation for Weighted Tree Automata. CAI (2009)
Andreas Maletti, Heiko Vogler
-Rules. FSMNLP (2009)
Markus Holzer, Andreas Maletti
An nlogn Algorithm for Hyper-minimizing States in a (Minimized) Deterministic Automaton. CIAA (2009)
Andreas Maletti, Jonathan Graehl, Mark Hopkins, Kevin Knight
The Power of Extended Top-Down Tree Transducers. SIAM J. Comput. 39 (2) (2009)
Johanna Högberg, Andreas Maletti, Jonathan May
Backward and forward bisimulation minimization of tree automata. Theor. Comput. Sci. 410 (37) (2009)
Andreas Maletti, Giorgio Satta
Parsing Algorithms based on Tree Automata. IWPT (2009)
Andreas Maletti, Catalin Ionut Tîrnauca
Properties of quasi-alphabetic tree bimorphisms CoRR (2009)
Joost Engelfriet, Eric Lilin, Andreas Maletti
Extended multi bottom-up tree transducers. Acta Informatica 46 (8) (2009)
Andreas Maletti
Minimizing Weighted Tree Grammars Using Simulation. FSMNLP (2009)

Andreas Maletti.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Andreas Maletti