Andreas Maletti

According to our database1, Andreas Maletti authored at least 100 papers between 2004 and 2018.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2018
Multiple context-free tree grammars: Lexicalization and characterization.
Theor. Comput. Sci., 2018

Pushing for weighted tree automata.
Logical Methods in Computer Science, 2018

Recurrent Neural Networks as Weighted Language Recognizers.
Proceedings of the 2018 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, 2018

2017
Survey: Finite-state technology in natural language processing.
Theor. Comput. Sci., 2017

Composition Closure of Linear Extended Top-down Tree Transducers.
Theory Comput. Syst., 2017

Pushing for weighted tree automata.
CoRR, 2017

Multiple Context-Free Tree Grammars: Lexicalization and Characterization.
CoRR, 2017

Synchronous Forest Substitution Grammars.
Acta Cybern., 2017

Multiple Context-Free Tree Grammars and Multi-component Tree Adjoining Grammars.
Proceedings of the Fundamentals of Computation Theory - 21st International Symposium, 2017

2016
Linking theorems for tree transducers.
J. Comput. Syst. Sci., 2016

Compositions of Tree-to-Tree Statistical Machine Translation Models.
Proceedings of the Developments in Language Theory - 20th International Conference, 2016

2015
Hyper-optimization for deterministic tree automata.
Theor. Comput. Sci., 2015

The Power of Weighted Regularity-Preserving Multi Bottom-Up Tree Transducers.
Int. J. Found. Comput. Sci., 2015

Discontinuous Statistical Machine Translation with Target-Side Dependency Syntax.
Proceedings of the Tenth Workshop on Statistical Machine Translation, 2015

Extended Tree Transducers in Natural Language Processing.
Proceedings of the 12th International Conference on Finite-State Methods and Natural Language Processing, 2015

String-to-Tree Multi Bottom-up Tree Transducers.
Proceedings of the 53rd Annual Meeting of the Association for Computational Linguistics and the 7th International Joint Conference on Natural Language Processing of the Asian Federation of Natural Language Processing, 2015

2014
Grammars, Parsers and Recognizers.
J. Log. Comput., 2014

Hyper-Minimization for Deterministic Weighted Tree Automata.
Proceedings of the Proceedings 14th International Conference on Automata and Formal Languages, 2014

The Power of Regularity-Preserving Multi Bottom-up Tree Transducers.
Proceedings of the Implementation and Application of Automata, 2014

2013
DIMwid - Decoder Inspection for Moses (using Widgets).
Prague Bull. Math. Linguistics, 2013

Hyper-Minimization for Deterministic Tree Automata.
Int. J. Found. Comput. Sci., 2013

Composition Closure of Linear Extended Top-down Tree Transducers
CoRR, 2013

Random Generation of Nondeterministic Finite-State Tree Automata.
Proceedings of the Proceedings Second International Workshop on Trends in Tree Automata and Tree Transducers, 2013

Hyper-optimization for Deterministic Tree Automata.
Proceedings of the Implementation and Application of Automata, 2013

Composition Closure of ε-Free Linear Extended Top-Down Tree Transducers.
Proceedings of the Developments in Language Theory - 17th International Conference, 2013

Synchronous Forest Substitution Grammars.
Proceedings of the Algebraic Informatics - 5th International Conference, 2013

Shallow Local Multi-Bottom-up Tree Transducers in Statistical Machine Translation.
Proceedings of the 51st Annual Meeting of the Association for Computational Linguistics, 2013

2012
Unweighted and Weighted Hyper-Minimization.
Int. J. Found. Comput. Sci., 2012

Hyper-minimization for Deterministic Tree Automata.
Proceedings of the Implementation and Application of Automata, 2012

Every sensible extended top-down tree transducer is a multi bottom-up tree transducer.
Proceedings of the Human Language Technologies: Conference of the North American Chapter of the Association of Computational Linguistics, 2012

Preservation of Recognizability for Weighted Linear Extended Top-Down Tree Transducers.
Proceedings of the Workshop on Applications of Tree Automata Techniques in Natural Language Processing, 2012

Composing extended top-down tree transducers.
Proceedings of the EACL 2012, 2012

Unidirectional Derivation Semantics for Synchronous Tree-Adjoining Grammars.
Proceedings of the Developments in Language Theory - 16th International Conference, 2012

Strong Lexicalization of Tree Adjoining Grammars.
Proceedings of the 50th Annual Meeting of the Association for Computational Linguistics, Proceedings of the Conference, July 8-14, 2012, Jeju Island, Korea, 2012

2011
An alternative to synchronous tree substitution grammars.
Natural Language Engineering, 2011

Optimal Hyper-Minimization.
Int. J. Found. Comput. Sci., 2011

The Category of Simulations for Weighted Tree Automata.
Int. J. Found. Comput. Sci., 2011

Survey: Weighted Extended Top-down Tree Transducers Part II - Application in Machine Translation.
Fundam. Inform., 2011

Weighted Extended Tree Transducers.
Fundam. Inform., 2011

Optimal Hyper-Minimization
CoRR, 2011

On minimising automata with errors
CoRR, 2011

Survey: Weighted Extended Top-down Tree Transducers Part I - Basics and Expressive Power.
Acta Cybern., 2011

MAT learners for tree series: an abstract data type and two realizations.
Acta Inf., 2011

Computing All ℓ-Cover Automata Fast.
Proceedings of the Implementation and Application of Automata, 2011

Tree Transformations and Dependencies.
Proceedings of the Mathematics of Language - 12th Biennial Conference, 2011

Pushing for Weighted Tree Automata.
Proceedings of the Mathematical Foundations of Computer Science 2011, 2011

On Minimising Automata with Errors.
Proceedings of the Mathematical Foundations of Computer Science 2011, 2011

Survey: Weighted Extended Top-Down Tree Transducers Part III - Composition.
Proceedings of the Algebraic Foundations in Computer Science, 2011

Hyper-minimisation of deterministic weighted finite automata over semifields.
Proceedings of the Automata and Formal Languages, 13th International Conference, 2011

Notes on Hyper-minimization.
Proceedings of the Automata and Formal Languages, 13th International Conference, 2011

How to train your multi bottom-up tree transducer.
Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies, 2011

2010
An nlogn algorithm for hyper-minimizing a (minimized) deterministic automaton.
Theor. Comput. Sci., 2010

Properties of Quasi-Relabeling Tree Bimorphisms.
Int. J. Found. Comput. Sci., 2010

Simulations of Weighted Tree Automata
CoRR, 2010

Simulation vs. Equivalence
CoRR, 2010

Better Hyper-minimization - Not as Fast, But Fewer Errors.
Proceedings of the Implementation and Application of Automata, 2010

Simulations of Weighted Tree Automata.
Proceedings of the Implementation and Application of Automata, 2010

Survey: Tree Transducers in Machine Translation.
Proceedings of the Second Workshop on Non-Classical Models for Automata and Applications - NCMA 2010, Jena, Germany, August 23, 2010

Why Synchronous Tree Substitution Grammars?
Proceedings of the Human Language Technologies: Conference of the North American Chapter of the Association of Computational Linguistics, 2010

Simulation vs. Equivalence.
Proceedings of the 2010 International Conference on Foundations of Computer Science, 2010

Input Products for Weighted Extended Top-Down Tree Transducers.
Proceedings of the Developments in Language Theory, 14th International Conference, 2010

Parsing and Translation Algorithms Based on Weighted Extended Tree Transducers.
Proceedings of the Workshop on Applications of Tree Automata in Natural Language Processing, 2010

A Tree Transducer Model for Synchronous Tree-Adjoining Grammars.
Proceedings of the ACL 2010, 2010

Preservation of Recognizability for Synchronous Tree Substitution Grammars.
Proceedings of the Workshop on Applications of Tree Automata in Natural Language Processing, 2010

2009
Backward and forward bisimulation minimization of tree automata.
Theor. Comput. Sci., 2009

The Power of Extended Top-Down Tree Transducers.
SIAM J. Comput., 2009

A Kleene Theorem for Weighted Tree Automata over Distributive Multioperator Monoids.
Theory Comput. Syst., 2009

Minimizing deterministic weighted tree automata.
Inf. Comput., 2009

Bisimulation Minimisation of Weighted Automata on Unranked Trees.
Fundam. Inform., 2009

Properties of quasi-alphabetic tree bimorphisms
CoRR, 2009

Extended multi bottom-up tree transducers.
Acta Inf., 2009

An nlogn Algorithm for Hyper-minimizing States in a (Minimized) Deterministic Automaton.
Proceedings of the Implementation and Application of Automata, 2009

Parsing Algorithms based on Tree Automata.
Proceedings of the 11th International Workshop on Parsing Technologies (IWPT-2009), 2009

Compositions of Top-Down Tree Transducers with epsilon-Rules.
Proceedings of the Finite-State Methods and Natural Language Processing, 2009

Minimizing Weighted Tree Grammars Using Simulation.
Proceedings of the Finite-State Methods and Natural Language Processing, 2009

Syntax-Directed Translations and Quasi-alphabetic Tree Bimorphisms - Revisited.
Proceedings of the Algebraic Informatics, Third International Conference, 2009

A Backward and a Forward Simulation for Weighted Tree Automata.
Proceedings of the Algebraic Informatics, Third International Conference, 2009

2008
Compositions of extended top-down tree transducers.
Inf. Comput., 2008

Tree-Series-to-Tree-Series Transformations.
Proceedings of the Implementation and Applications of Automata, 2008

Myhill-Nerode Theorem for Recognizable Tree Series Revisited.
Proceedings of the LATIN 2008: Theoretical Informatics, 2008

Minimizing Deterministic Weighted Tree Automata.
Proceedings of the Language and Automata Theory and Applications, 2008

Extended Multi Bottom-Up Tree Transducers.
Proceedings of the Developments in Language Theory, 12th International Conference, 2008

2007
Pure and O-Substitution.
Int. J. Found. Comput. Sci., 2007

Backward and Forward Bisimulation Minimisation of Tree Automata.
Proceedings of the Implementation and Application of Automata, 2007

Compositions of Extended Top-down Tree Transducers.
Proceedings of the LATA 2007. Proceedings of the 1st International Conference on Language and Automata Theory and Applications., 2007

Bisimulation Minimisation for Weighted Tree Automata.
Proceedings of the Developments in Language Theory, 11th International Conference, 2007

Learning Deterministically Recognizable Tree Series - Revisited.
Proceedings of the Algebraic Informatics, Second International Conference, 2007

2006
The power of tree series transducers.
PhD thesis, 2006

Compositions of tree series transformations.
Theor. Comput. Sci., 2006

Cut sets as recognizable tree languages.
Fuzzy Sets and Systems, 2006

Does o-Substitution Preserve Recognizability?
Proceedings of the Implementation and Application of Automata, 2006

Hierarchies of Tree Series Transformations Revisited.
Proceedings of the Developments in Language Theory, 10th International Conference, 2006

The Substitution Vanishes.
Proceedings of the Algebraic Methodology and Software Technology, 2006

2005
HASSE diagrams for classes of deterministic bottom-up tree-to-tree-series transformations.
Theor. Comput. Sci., 2005

Incomparability Results for Classes of Polynomial Tree Series Transformations.
Journal of Automata, Languages and Combinatorics, 2005

Bounds for Tree Automata with Polynomial Costs.
Journal of Automata, Languages and Combinatorics, 2005

Relating tree series transducers and weighted tree automata.
Int. J. Found. Comput. Sci., 2005

The Power of Tree Series Transducers of Type I and II.
Proceedings of the Developments in Language Theory, 9th International Conference, 2005

2004
Myhill-Nerode Theorem for Sequential Transducers over Unique GCD-Monoids.
Proceedings of the Implementation and Application of Automata, 2004

Relating Tree Series Transducers and Weighted Tree Automata.
Proceedings of the Developments in Language Theory, 2004


  Loading...