default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAndreas Maletti
Person information
- affiliation: Leipzig University, Germany
- affiliation: University of Stuttgart, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j45]Andreas Maletti:
Compositions of Weighted Extended Tree Transducers - The Unambiguous Case. Int. J. Found. Comput. Sci. 35(1&2): 107-127 (2024)- [j44]Andreas Maletti, Andreea-Teodora Nász:
Weighted Tree Automata with Constraints. Theory Comput. Syst. 68(1): 1-28 (2024) - [c68]Andreas Maletti, Andreea-Teodora Nász, Erik Paul:
Weighted HOM-Problem for Nonnegative Integers. STACS 2024: 51:1-51:17 - 2023
- [j43]Andreas Maletti
, Lena Katharina Schiffer:
Combinatory categorial grammars as generators of weighted forests. Inf. Comput. 294: 105075 (2023) - [j42]Fan Feng, Andreas Maletti:
Weighted two-way transducers. Inf. Comput. 295(Part B): 105094 (2023) - [j41]Malte Blattmann, Andreas Maletti:
Compositions with Constant Weighted Extended Tree Transducers. Int. J. Found. Comput. Sci. 34(6): 539-558 (2023) - [j40]Andreas Maletti, Teodora Nasz, Kevin Stier, Markus Ulbricht:
Ambiguity Hierarchies for Weighted Tree Automata. Int. J. Found. Comput. Sci. 34(8): 903-921 (2023) - [c67]Andreas Maletti, Andreea-Teodora Nász:
Weighted Bottom-Up and Top-Down Tree Transformations Are Incomparable. CIAA 2023: 218-229 - [c66]Andreas Maletti, Nils Oskar Nuernbergk:
Pumping Lemmata for Recognizable Weighted Languages over Artinian Semirings. AFL 2023: 155-169 - [i11]Andreas Maletti, Andreea-Teodora Nász:
Weighted Tree Automata with Constraints. CoRR abs/2302.03434 (2023) - [i10]Andreas Maletti, Andreea-Teodora Nász, Erik Paul:
Weighted HOM-Problem for Nonnegative Integers. CoRR abs/2305.04117 (2023) - 2022
- [j39]Manfred Droste, Andreas Maletti, Heiko Vogler:
Preface. Inf. Comput. 282: 104646 (2022) - [j38]Marco Kuhlmann, Andreas Maletti, Lena Katharina Schiffer:
The tree-generative capacity of combinatory categorial grammars. J. Comput. Syst. Sci. 124: 214-233 (2022) - [c65]Fan Feng, Andreas Maletti:
Weighted Two-Way Transducers. CAI 2022: 101-114 - [c64]Andreas Maletti, Andreea-Teodora Nász:
Weighted Tree Automata with Constraints. DLT 2022: 226-238 - [i9]Andreas Maletti, Lena Katharina Schiffer:
Strong Equivalence of TAG and CCG. CoRR abs/2205.07743 (2022) - 2021
- [j37]Lena Katharina Schiffer, Andreas Maletti:
Strong Equivalence of TAG and CCG. Trans. Assoc. Comput. Linguistics 9: 707-720 (2021) - [c63]Malte Blattmann, Andreas Maletti:
Compositions of Constant Weighted Extended Tree Transducers. DLT 2021: 66-77 - [c62]Andreas Maletti, Teodora Nasz, Kevin Stier, Markus Ulbricht:
Ambiguity Hierarchies for Weighted Tree Automata. CIAA 2021: 140-151 - 2020
- [c61]Andreas Maletti, Kevin Stier:
On Tree Substitution Grammars. DLT 2020: 237-250
2010 – 2019
- 2019
- [c60]Marco Kuhlmann, Andreas Maletti, Lena Katharina Schiffer:
The Tree-Generative Capacity of Combinatory Categorial Grammars. FSTTCS 2019: 44:1-44:14 - [c59]Zoltán Fülöp, Andreas Maletti:
Composition Closure of Linear Weighted Extended Top-Down Tree Transducers. CIAA 2019: 133-145 - [e4]Heiko Vogler, Andreas Maletti:
Proceedings of the 14th International Conference on Finite-State Methods and Natural Language Processing, FSMNLP 2019, Dresden, Germany, September 23-25, 2019. Association for Computational Linguistics 2019 [contents] - 2018
- [j36]Andreas Maletti:
Compositions of Tree-to-Tree Statistical Machine Translation Models. Int. J. Found. Comput. Sci. 29(5): 877-892 (2018) - [j35]Thomas Hanneforth, Andreas Maletti, Daniel Quernheim:
Pushing for weighted tree automata. Log. Methods Comput. Sci. 14(1) (2018) - [j34]Joost Engelfriet, Andreas Maletti, Sebastian Maneth:
Multiple context-free tree grammars: Lexicalization and characterization. Theor. Comput. Sci. 728: 29-99 (2018) - [c58]Yining Chen, Sorcha Gilroy, Andreas Maletti, Jonathan May, Kevin Knight:
Recurrent Neural Networks as Weighted Language Recognizers. NAACL-HLT 2018: 2261-2271 - 2017
- [j33]Andreas Maletti:
Synchronous Forest Substitution Grammars. Acta Cybern. 23(1): 269-281 (2017) - [j32]Joost Engelfriet, Zoltán Fülöp, Andreas Maletti:
Composition Closure of Linear Extended Top-down Tree Transducers. Theory Comput. Syst. 60(2): 129-171 (2017) - [j31]Andreas Maletti:
Survey: Finite-state technology in natural language processing. Theor. Comput. Sci. 679: 2-17 (2017) - [c57]Joost Engelfriet, Andreas Maletti:
Multiple Context-Free Tree Grammars and Multi-component Tree Adjoining Grammars. FCT 2017: 217-229 - [i8]Thomas Hanneforth, Andreas Maletti, Daniel Quernheim:
Pushing for weighted tree automata. CoRR abs/1702.00304 (2017) - [i7]Joost Engelfriet, Andreas Maletti, Sebastian Maneth:
Multiple Context-Free Tree Grammars: Lexicalization and Characterization. CoRR abs/1707.03457 (2017) - 2016
- [j30]Zoltán Fülöp, Andreas Maletti:
Linking theorems for tree transducers. J. Comput. Syst. Sci. 82(7): 1201-1222 (2016) - [c56]Andreas Maletti:
Compositions of Tree-to-Tree Statistical Machine Translation Models. DLT 2016: 293-305 - 2015
- [j29]Andreas Maletti:
The Power of Weighted Regularity-Preserving Multi Bottom-Up Tree Transducers. Int. J. Found. Comput. Sci. 26(7): 987- (2015) - [j28]Andreas Maletti:
Hyper-optimization for deterministic tree automata. Theor. Comput. Sci. 578: 72-87 (2015) - [c55]Nina Seemann, Fabienne Braune, Andreas Maletti:
String-to-Tree Multi Bottom-up Tree Transducers. ACL (1) 2015: 815-824 - [c54]Andreas Maletti:
Extended Tree Transducers in Natural Language Processing. FSMNLP 2015 - [c53]Nina Seemann, Fabienne Braune, Andreas Maletti:
A systematic evaluation of MBOT in statistical machine translation. MTSummit 2015 - [c52]Nina Seemann, Andreas Maletti:
Discontinuous Statistical Machine Translation with Target-Side Dependency Syntax. WMT@EMNLP 2015: 239-247 - [e3]Andreas Maletti:
Algebraic Informatics - 6th International Conference, CAI 2015, Stuttgart, Germany, September 1-4, 2015. Proceedings. Lecture Notes in Computer Science 9270, Springer 2015, ISBN 978-3-319-23020-7 [contents] - 2014
- [j27]Harry Bunt, Andreas Maletti, Joakim Nivre:
Grammars, Parsers and Recognizers. J. Log. Comput. 24(2): 309 (2014) - [c51]Junfei Guo, Juan Liu, Qi Han, Andreas Maletti:
A tunable language model for statistical machine translation. AMTA 2014: 356-368 - [c50]Andreas Maletti:
The Power of Regularity-Preserving Multi Bottom-up Tree Transducers. CIAA 2014: 278-289 - [c49]Andreas Maletti, Daniel Quernheim:
Hyper-Minimization for Deterministic Weighted Tree Automata. AFL 2014: 314-326 - [e2]Özlem Çetinoglu, Jeffrey Heinz, Andreas Maletti, Jason Riggle:
Proceedings of the 2014 Joint Meeting of SIGMORPHON and SIGFSM, Baltimore, Maryland, USA, June 27, 2014. Association for Computational Linguistics 2014, ISBN 978-1-941643-13-6 [contents] - 2013
- [j26]Artur Jez, Andreas Maletti:
Hyper-Minimization for Deterministic Tree Automata. Int. J. Found. Comput. Sci. 24(6): 815-830 (2013) - [j25]Robin Kurtz, Nina Seemann, Fabienne Braune, Andreas Maletti:
DIMwid - Decoder Inspection for Moses (using Widgets). Prague Bull. Math. Linguistics 100: 41-50 (2013) - [c48]Fabienne Braune, Nina Seemann, Daniel Quernheim, Andreas Maletti:
Shallow Local Multi-Bottom-up Tree Transducers in Statistical Machine Translation. ACL (1) 2013: 811-821 - [c47]Andreas Maletti:
Synchronous Forest Substitution Grammars. CAI 2013: 235-246 - [c46]Zoltán Fülöp, Andreas Maletti:
Composition Closure of ε-Free Linear Extended Top-Down Tree Transducers. Developments in Language Theory 2013: 239-251 - [c45]Andreas Maletti:
Hyper-optimization for Deterministic Tree Automata. CIAA 2013: 244-255 - [c44]Thomas Hanneforth, Andreas Maletti, Daniel Quernheim:
Random Generation of Nondeterministic Finite-State Tree Automata. TTATT 2013: 11-16 - [i6]Zoltán Fülöp, Andreas Maletti:
Composition Closure of Linear Extended Top-down Tree Transducers. CoRR abs/1301.1514 (2013) - 2012
- [j24]Andreas Maletti, Daniel Quernheim:
Unweighted and Weighted Hyper-Minimization. Int. J. Found. Comput. Sci. 23(6): 1207-1226 (2012) - [c43]Andreas Maletti, Joost Engelfriet:
Strong Lexicalization of Tree Adjoining Grammars. ACL (1) 2012: 506-515 - [c42]Matthias Büchse, Andreas Maletti, Heiko Vogler:
Unidirectional Derivation Semantics for Synchronous Tree-Adjoining Grammars. Developments in Language Theory 2012: 368-379 - [c41]Nina Seemann, Daniel Quernheim, Fabienne Braune, Andreas Maletti:
Preservation of Recognizability for Weighted Linear Extended Top-Down Tree Transducers. ATANLP@EACL 2012: 1-10 - [c40]Aurélie Lagoutte, Fabienne Braune, Daniel Quernheim, Andreas Maletti:
Composing extended top-down tree transducers. EACL 2012: 808-817 - [c39]Andreas Maletti:
Every sensible extended top-down tree transducer is a multi bottom-up tree transducer. HLT-NAACL 2012: 263-273 - [c38]Artur Jez, Andreas Maletti:
Hyper-minimization for Deterministic Tree Automata. CIAA 2012: 217-228 - 2011
- [j23]Frank Drewes, Johanna Högberg, Andreas Maletti:
MAT learners for tree series: an abstract data type and two realizations. Acta Informatica 48(3): 165-189 (2011) - [j22]Andreas Maletti:
Survey: Weighted Extended Top-down Tree Transducers Part I - Basics and Expressive Power. Acta Cybern. 20(2): 223-250 (2011) - [j21]Zoltán Fülöp, Andreas Maletti, Heiko Vogler:
Weighted Extended Tree Transducers. Fundam. Informaticae 111(2): 163-202 (2011) - [j20]Andreas Maletti:
Survey: Weighted Extended Top-down Tree Transducers Part II - Application in Machine Translation. Fundam. Informaticae 112(2-3): 239-261 (2011) - [j19]Zoltán Ésik, Andreas Maletti:
The Category of Simulations for Weighted Tree Automata. Int. J. Found. Comput. Sci. 22(8): 1845-1859 (2011) - [j18]Andreas Maletti, Daniel Quernheim:
Optimal Hyper-Minimization. Int. J. Found. Comput. Sci. 22(8): 1877-1891 (2011) - [j17]Andreas Maletti:
An alternative to synchronous tree substitution grammars. Nat. Lang. Eng. 17(2): 221-242 (2011) - [c37]Andreas Maletti:
How to train your multi bottom-up tree transducer. ACL 2011: 825-834 - [c36]Andreas Maletti:
Notes on Hyper-minimization. AFL 2011: 34-49 - [c35]Andreas Maletti, Daniel Quernheim:
Hyper-minimisation of deterministic weighted finite automata over semifields. AFL 2011: 285-299 - [c34]Aurélie Lagoutte, Andreas Maletti:
Survey: Weighted Extended Top-Down Tree Transducers Part III - Composition. Algebraic Foundations in Computer Science 2011: 272-308 - [c33]Pawel Gawrychowski, Artur Jez, Andreas Maletti:
On Minimising Automata with Errors. MFCS 2011: 327-338 - [c32]Andreas Maletti, Daniel Quernheim:
Pushing for Weighted Tree Automata. MFCS 2011: 460-471 - [c31]Andreas Maletti:
Tree Transformations and Dependencies. MOL 2011: 1-20 - [c30]Artur Jez, Andreas Maletti:
Computing All ℓ-Cover Automata Fast. CIAA 2011: 203-214 - [e1]Matthieu Constant, Andreas Maletti, Agata Savary:
Finite-State Methods and Natural Language Processing, 9th International Workshop, FSMNLP 2010, Bois, France, July 12-16, 2011. ACL Anthology, Association for Computational Linguistics 2011 [contents] - [i5]Pawel Gawrychowski, Artur Jez, Andreas Maletti:
On minimising automata with errors. CoRR abs/1102.5682 (2011) - [i4]Andreas Maletti, Daniel Quernheim:
Optimal Hyper-Minimization. CoRR abs/1104.3007 (2011) - 2010
- [j16]Andreas Maletti, Catalin Ionut Tîrnauca:
Properties of Quasi-Relabeling Tree Bimorphisms. Int. J. Found. Comput. Sci. 21(3): 257-276 (2010) - [j15]Markus Holzer, Andreas Maletti:
An nlogn algorithm for hyper-minimizing a (minimized) deterministic automaton. Theor. Comput. Sci. 411(38-39): 3404-3413 (2010) - [c29]Zoltán Fülöp, Andreas Maletti, Heiko Vogler:
Preservation of Recognizability for Synchronous Tree Substitution Grammars. ATANLP@ACL 2010 2010: 1-9 - [c28]Andreas Maletti, Giorgio Satta:
Parsing and Translation Algorithms Based on Weighted Extended Tree Transducers. ATANLP@ACL 2010 2010: 19-27 - [c27]Andreas Maletti:
A Tree Transducer Model for Synchronous Tree-Adjoining Grammars. ACL 2010: 1067-1076 - [c26]Andreas Maletti:
Input Products for Weighted Extended Top-Down Tree Transducers. Developments in Language Theory 2010: 316-327 - [c25]Zoltán Ésik, Andreas Maletti:
Simulation vs. Equivalence. FCS 2010: 119-124 - [c24]Andreas Maletti:
Why Synchronous Tree Substitution Grammars? HLT-NAACL 2010: 876-884 - [c23]Andreas Maletti:
Survey: Tree Transducers in Machine Translation. NCMA 2010: 11-32 - [c22]Andreas Maletti:
Better Hyper-minimization - Not as Fast, But Fewer Errors. CIAA 2010: 201-210 - [c21]Zoltán Ésik, Andreas Maletti:
Simulations of Weighted Tree Automata. CIAA 2010: 321-330 - [i3]Zoltán Ésik, Andreas Maletti:
Simulation vs. Equivalence. CoRR abs/1004.2426 (2010) - [i2]Zoltán Ésik, Andreas Maletti:
Simulations of Weighted Tree Automata. CoRR abs/1005.2079 (2010)
2000 – 2009
- 2009
- [j14]Joost Engelfriet, Eric Lilin, Andreas Maletti:
Extended multi bottom-up tree transducers. Acta Informatica 46(8): 561-590 (2009) - [j13]Johanna Högberg, Andreas Maletti, Heiko Vogler:
Bisimulation Minimisation of Weighted Automata on Unranked Trees. Fundam. Informaticae 92(1-2): 103-130 (2009) - [j12]Andreas Maletti:
Minimizing deterministic weighted tree automata. Inf. Comput. 207(11): 1284-1299 (2009) - [j11]Zoltán Fülöp, Andreas Maletti, Heiko Vogler:
A Kleene Theorem for Weighted Tree Automata over Distributive Multioperator Monoids. Theory Comput. Syst. 44(3): 455-499 (2009) - [j10]Andreas Maletti, Jonathan Graehl, Mark Hopkins, Kevin Knight:
The Power of Extended Top-Down Tree Transducers. SIAM J. Comput. 39(2): 410-430 (2009) - [j9]Johanna Högberg, Andreas Maletti, Jonathan May:
Backward and forward bisimulation minimization of tree automata. Theor. Comput. Sci. 410(37): 3539-3552 (2009) - [c20]Andreas Maletti:
A Backward and a Forward Simulation for Weighted Tree Automata. CAI 2009: 288-304 - [c19]Andreas Maletti, Catalin Ionut Tîrnauca:
Syntax-Directed Translations and Quasi-alphabetic Tree Bimorphisms - Revisited. CAI 2009: 305-317 - [c18]Andreas Maletti:
Minimizing Weighted Tree Grammars Using Simulation. FSMNLP 2009: 56-68 - [c17]Andreas Maletti, Heiko Vogler:
Compositions of Top-Down Tree Transducers with epsilon-Rules. FSMNLP 2009: 69-80 - [c16]Andreas Maletti, Giorgio Satta:
Parsing Algorithms based on Tree Automata. IWPT 2009: 1-12 - [c15]Markus Holzer, Andreas Maletti:
An nlogn Algorithm for Hyper-minimizing States in a (Minimized) Deterministic Automaton. CIAA 2009: 4-13 - [i1]Andreas Maletti, Catalin Ionut Tîrnauca:
Properties of quasi-alphabetic tree bimorphisms. CoRR abs/0906.2369 (2009) - 2008
- [j8]Andreas Maletti:
Compositions of extended top-down tree transducers. Inf. Comput. 206(9-10): 1187-1196 (2008) - [c14]Joost Engelfriet, Eric Lilin, Andreas Maletti:
Extended Multi Bottom-Up Tree Transducers. Developments in Language Theory 2008: 289-300 - [c13]Andreas Maletti:
Minimizing Deterministic Weighted Tree Automata. LATA 2008: 357-372 - [c12]Andreas Maletti:
Myhill-Nerode Theorem for Recognizable Tree Series Revisited. LATIN 2008: 106-120 - [c11]Andreas Maletti:
Tree-Series-to-Tree-Series Transformations. CIAA 2008: 132-140 - 2007
- [j7]Andreas Maletti:
Pure and O-Substitution. Int. J. Found. Comput. Sci. 18(4): 829-845 (2007) - [c10]Andreas Maletti:
Learning Deterministically Recognizable Tree Series - Revisited. CAI 2007: 218-235 - [c9]Johanna Högberg, Andreas Maletti, Jonathan May:
Bisimulation Minimisation for Weighted Tree Automata. Developments in Language Theory 2007: 229-241 - [c8]Andreas Maletti:
Compositions of Extended Top-down Tree Transducers. LATA 2007: 379-390 - [c7]Johanna Högberg, Andreas Maletti, Jonathan May:
Backward and Forward Bisimulation Minimisation of Tree Automata. CIAA 2007: 109-121 - 2006
- [b1]Andreas Maletti:
The power of tree series transducers. Dresden University of Technology, 2006, ISBN 978-3-89959-562-8, pp. 1-187 - [j6]Björn Borchardt, Andreas Maletti, Branimir Seselja, Andreja Tepavcevic, Heiko Vogler:
Cut sets as recognizable tree languages. Fuzzy Sets Syst. 157(11): 1560-1571 (2006) - [j5]Andreas Maletti:
Compositions of tree series transformations. Theor. Comput. Sci. 366(3): 248-271 (2006) - [c6]Armin Kühnemann, Andreas Maletti:
The Substitution Vanishes. AMAST 2006: 173-188 - [c5]Andreas Maletti:
Hierarchies of Tree Series Transformations Revisited. Developments in Language Theory 2006: 215-225 - [c4]Andreas Maletti:
Does o-Substitution Preserve Recognizability? CIAA 2006: 150-161 - 2005
- [j4]Andreas Maletti:
Relating tree series transducers and weighted tree automata. Int. J. Found. Comput. Sci. 16(4): 723-741 (2005) - [j3]Björn Borchardt, Zoltán Fülöp, Zsolt Gazdag, Andreas Maletti:
Bounds for Tree Automata with Polynomial Costs. J. Autom. Lang. Comb. 10(2/3): 107-157 (2005) - [j2]Andreas Maletti, Heiko Vogler:
Incomparability Results for Classes of Polynomial Tree Series Transformations. J. Autom. Lang. Comb. 10(4): 535-568 (2005) - [j1]Andreas Maletti:
HASSE diagrams for classes of deterministic bottom-up tree-to-tree-series transformations. Theor. Comput. Sci. 339(2-3): 200-240 (2005) - [c3]Andreas Maletti:
The Power of Tree Series Transducers of Type I and II. Developments in Language Theory 2005: 338-349 - 2004
- [c2]Andreas Maletti:
Relating Tree Series Transducers and Weighted Tree Automata. Developments in Language Theory 2004: 321-333 - [c1]Andreas Maletti:
Myhill-Nerode Theorem for Sequential Transducers over Unique GCD-Monoids. CIAA 2004: 323-324