Andreas Maletti

Joakim Nivre

J. Log. Comput., 2014

Hyper-Minimization for Deterministic Weighted Tree Automata.

[BibT_eX]

[DOI]

Proceedings of the Proceedings 14th International Conference on Automata and Formal Languages, 2014

The Power of Regularity-Preserving Multi Bottom-up Tree Transducers.

[BibT_eX]

[DOI]

Proceedings of the Implementation and Application of Automata, 2014

A tunable language model for statistical machine translation.

[BibT_eX]

[DOI]

Proceedings of the 11th Conference of the Association for Machine Translation in the Americas: MT Researchers Track, 2014

2013

DIMwid - Decoder Inspection for Moses (using Widgets).

[BibT_eX]

[DOI]

Prague Bull. Math. Linguistics, 2013

Hyper-Minimization for Deterministic Tree Automata.

[BibT_eX]

[DOI]

Artur Jez

Int. J. Found. Comput. Sci., 2013

Composition Closure of Linear Extended Top-down Tree Transducers

[BibT_eX]

[DOI]

CoRR, 2013

Random Generation of Nondeterministic Finite-State Tree Automata.

[BibT_eX]

[DOI]

Thomas Hanneforth

Proceedings of the Proceedings Second International Workshop on Trends in Tree Automata and Tree Transducers, 2013

Composition Closure of ε-Free Linear Extended Top-Down Tree Transducers.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory - 17th International Conference, 2013

Shallow Local Multi-Bottom-up Tree Transducers in Statistical Machine Translation.

[BibT_eX]

[DOI]

Proceedings of the 51st Annual Meeting of the Association for Computational Linguistics, 2013

2012

Unweighted and Weighted Hyper-Minimization.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2012

Every sensible extended top-down tree transducer is a multi bottom-up tree transducer.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the Workshop on Applications of Tree Automata Techniques in Natural Language Processing, 2012

Composing extended top-down tree transducers.

[BibT_eX]

[DOI]

Proceedings of the EACL 2012, 2012

Unidirectional Derivation Semantics for Synchronous Tree-Adjoining Grammars.

[BibT_eX]

[DOI]

Matthias Büchse

Proceedings of the Developments in Language Theory - 16th International Conference, 2012

Strong Lexicalization of Tree Adjoining Grammars.

[BibT_eX]

[DOI]

Joost Engelfriet

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.

[BibT_eX]

[DOI]

Nat. Lang. Eng., 2011

Optimal Hyper-Minimization.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2011

The Category of Simulations for Weighted Tree Automata.

[BibT_eX]

[DOI]

Zoltán Ésik

Int. J. Found. Comput. Sci., 2011

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

[BibT_eX]

[DOI]

Fundam. Informaticae, 2011

Weighted Extended Tree Transducers.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2011

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

[BibT_eX]

[DOI]

Acta Cybern., 2011

MAT learners for tree series: an abstract data type and two realizations.

[BibT_eX]

[DOI]

Frank Drewes

Acta Informatica, 2011

Computing All ℓ-Cover Automata Fast.

[BibT_eX]

[DOI]

Artur Jez

Proceedings of the Implementation and Application of Automata, 2011

Tree Transformations and Dependencies.

[BibT_eX]

[DOI]

Proceedings of the Mathematics of Language - 12th Biennial Conference, 2011

Pushing for Weighted Tree Automata.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2011, 2011

On Minimising Automata with Errors.

[BibT_eX]

[DOI]

Pawel Gawrychowski

Artur Jez

Proceedings of the Mathematical Foundations of Computer Science 2011, 2011

Survey: Weighted Extended Top-Down Tree Transducers Part III - Composition.

[BibT_eX]

[DOI]

Aurélie Lagoutte

Proceedings of the Algebraic Foundations in Computer Science, 2011

Hyper-minimisation of deterministic weighted finite automata over semifields.

[BibT_eX]

Proceedings of the Automata and Formal Languages, 13th International Conference, 2011

Notes on Hyper-minimization.

[BibT_eX]

Proceedings of the Automata and Formal Languages, 13th International Conference, 2011

How to train your multi bottom-up tree transducer.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Markus Holzer

Theor. Comput. Sci., 2010

Properties of Quasi-Relabeling Tree Bimorphisms.

[BibT_eX]

[DOI]

Catalin Ionut Tîrnauca

Int. J. Found. Comput. Sci., 2010

Better Hyper-minimization - Not as Fast, But Fewer Errors.

[BibT_eX]

[DOI]

Proceedings of the Implementation and Application of Automata, 2010

Simulations of Weighted Tree Automata.

[BibT_eX]

[DOI]

Zoltán Ésik

Proceedings of the Implementation and Application of Automata, 2010

Survey: Tree Transducers in Machine Translation.

[BibT_eX]

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?

[BibT_eX]

[DOI]

Proceedings of the Human Language Technologies: Conference of the North American Chapter of the Association of Computational Linguistics, 2010

Simulation vs. Equivalence.

[BibT_eX]

Zoltán Ésik

Proceedings of the 2010 International Conference on Foundations of Computer Science, 2010

Input Products for Weighted Extended Top-Down Tree Transducers.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory, 14th International Conference, 2010

Parsing and Translation Algorithms Based on Weighted Extended Tree Transducers.

[BibT_eX]

[DOI]

Giorgio Satta

Proceedings of the Workshop on Applications of Tree Automata in Natural Language Processing, 2010

A Tree Transducer Model for Synchronous Tree-Adjoining Grammars.

[BibT_eX]

[DOI]

Proceedings of the ACL 2010, 2010

Preservation of Recognizability for Synchronous Tree Substitution Grammars.

[BibT_eX]

[DOI]

Proceedings of the Workshop on Applications of Tree Automata in Natural Language Processing, 2010

2009

Backward and forward bisimulation minimization of tree automata.

[BibT_eX]

[DOI]

Jonathan May

Theor. Comput. Sci., 2009

The Power of Extended Top-Down Tree Transducers.

[BibT_eX]

[DOI]

SIAM J. Comput., 2009

A Kleene Theorem for Weighted Tree Automata over Distributive Multioperator Monoids.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2009

Minimizing deterministic weighted tree automata.

[BibT_eX]

[DOI]

Inf. Comput., 2009

Bisimulation Minimisation of Weighted Automata on Unranked Trees.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2009

Properties of quasi-alphabetic tree bimorphisms

[BibT_eX]

[DOI]

Catalin Ionut Tîrnauca

CoRR, 2009

Extended multi bottom-up tree transducers.

[BibT_eX]

[DOI]

Joost Engelfriet

Eric Lilin

Acta Informatica, 2009

An nlogn Algorithm for Hyper-minimizing States in a (Minimized) Deterministic Automaton.

[BibT_eX]

[DOI]

Markus Holzer

Proceedings of the Implementation and Application of Automata, 2009

Parsing Algorithms based on Tree Automata.

[BibT_eX]

[DOI]

Giorgio Satta

Proceedings of the 11th International Workshop on Parsing Technologies (IWPT-2009), 2009

Compositions of Top-Down Tree Transducers with <i>epsilon</i>-Rules.

[BibT_eX]

[DOI]

Proceedings of the Finite-State Methods and Natural Language Processing, 2009

Minimizing Weighted Tree Grammars Using Simulation.

[BibT_eX]

[DOI]

Proceedings of the Finite-State Methods and Natural Language Processing, 2009

Syntax-Directed Translations and Quasi-alphabetic Tree Bimorphisms - Revisited.

[BibT_eX]

[DOI]

Catalin Ionut Tîrnauca

Proceedings of the Algebraic Informatics, Third International Conference, 2009

A Backward and a Forward Simulation for Weighted Tree Automata.

[BibT_eX]

[DOI]

Proceedings of the Algebraic Informatics, Third International Conference, 2009

2008

Compositions of extended top-down tree transducers.

[BibT_eX]

[DOI]

Inf. Comput., 2008

Tree-Series-to-Tree-Series Transformations.

[BibT_eX]

[DOI]

Proceedings of the Implementation and Applications of Automata, 2008

Myhill-Nerode Theorem for Recognizable Tree Series Revisited.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2008: Theoretical Informatics, 2008

2007

Pure and O-Substitution.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2007

Backward and Forward Bisimulation Minimisation of Tree Automata.

[BibT_eX]

[DOI]

Jonathan May

Proceedings of the Implementation and Application of Automata, 2007

Bisimulation Minimisation for Weighted Tree Automata.

[BibT_eX]

[DOI]

Jonathan May

Proceedings of the Developments in Language Theory, 11th International Conference, 2007

Learning Deterministically Recognizable Tree Series - Revisited.

[BibT_eX]

[DOI]

Proceedings of the Algebraic Informatics, Second International Conference, 2007

2006

The power of tree series transducers.

[BibT_eX]

[DOI]

PhD thesis, 2006

Compositions of tree series transformations.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2006

Cut sets as recognizable tree languages.

[BibT_eX]

[DOI]

Fuzzy Sets Syst., 2006

Does o-Substitution Preserve Recognizability?

[BibT_eX]

[DOI]

Proceedings of the Implementation and Application of Automata, 2006

Hierarchies of Tree Series Transformations Revisited.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory, 10th International Conference, 2006

The Substitution Vanishes.

[BibT_eX]

[DOI]

Armin Kühnemann

Proceedings of the Algebraic Methodology and Software Technology, 2006

2005

HASSE diagrams for classes of deterministic bottom-up tree-to-tree-series transformations.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2005

Incomparability Results for Classes of Polynomial Tree Series Transformations.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2005

Bounds for Tree Automata with Polynomial Costs.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2005

Relating tree series transducers and weighted tree automata.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2005

The Power of Tree Series Transducers of Type I and II.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory, 9th International Conference, 2005

2004

Myhill-Nerode Theorem for Sequential Transducers over Unique GCD-Monoids.

[BibT_eX]

[DOI]