2019
Characterizations of subregular tree languages
Applications of weighted tree automata and tree transducers
in natural language processing
Interactive proof systems and polynomial space
Composition hierarchies of linear weighted extended top-down
tree transducers
Business meeting notes
Tree substitution grammars
Tree substitution grammars
2018
Quantitative logics and automata
Composition hierarchies of linear weighted extended
top-down tree transducers
Tree automata in parsing and machine translation
Characterizations of subregular tree languages
2017
Tree automata in parsing and machine translation
Tree automata in parsing and machine translation
Business meeting notes
Multi context-free tree grammars and multi-component
tree adjoining grammars
Multi context-free tree grammars and multi-component
tree adjoining grammars
2016
Weighted automata in statistical machine translation 4th trends in tree automata and tree transducers Compositions of tree-to-tree statistical machine translation models Statistical NLP and weighted automata Tree automata in parsing and machine translation Tree automata in parsing and machine translation Tree automata in parsing and machine translation
2015
Syntax-basierte maschinelle Übersetzung mit Baumübersetzern Syntax-basierte maschinelle Übersetzung mit Baumübersetzern Extended Tree Transducers in Natural Language Processing Extended Tree Transducers in Natural Language Processing Business Meeting Finite-State Technology in Natural Language Processing Linking Theorems for Tree Transducers Applications of Tree Automata Expressive Power of Syntax-based Machine Translation Formalisms
2014
Composition Closure of Linear Extended Top-down Tree Transducers Weighted Automata Techniques in Statistical Machine Translation Hyper-minimization for Deterministic Weighted Tree Automata The Power of Regularity-Preserving Multi Bottom-up Tree Transducers Applications of Automata Theory in Parsing and Machine Translation [Teile I , II , III , IV , V , VI ]
Rule Extraction for Machine Translation
2013
Pushing for Weighted Tree Automata Statistical Machine Translation — What Works and What Does Not Composition Closure of ε-free Linear Extended Top-down Tree Transducers Business Meeting Notes Hyper-Optimization for Deterministic Tree Automata Synchronous Forest Substitution Grammars Random Generation of Nondeterministic Tree Automata Machine Translation with Multi Bottom-up Tree Transducers
2012
Multi Bottom-up Tree Transducers Strong Lexicalization of Tree Adjoining Grammars Every Sensible Extended Top-down Tree Transducer is a Multi Bottom-up Tree Transducer Strong Lexicalization of Tree-Adjoining Grammars Hyper-Minimization for Deterministic Tree Automata Unidirectional Derivation Semantics for Synchronous Tree-Adjoining Grammars Trees Abound — Tree Automata and Tree Transducers Syntax-based Machine Translation using Multi Bottom-up Tree Transducers Minimization of Non-Deterministic Weighted Tree Automata
2011
Tree Transducers in Machine Translation How to Train your Multi Bottom-up Tree Transducer Baumübersetzer in der statistischen Übersetzung Hyper-Minimisation of Weighted Finite Automata Hyper-Minimization — Lossy Compression of Deterministic Automata Tree Transformations and Dependencies Preservation of Recognizability for Weighted Extended Top-down Tree Transducers Compositions of Weighted Extended Top-down Tree Transducers Tree Transducers in Machine Translation
2010
Weighted Multi Bottom-up Tree Transducers A Gentle Introduction to Weighted Extended Top-down Tree Transducers Weighted Tree Transducers in Natural Language Processing Minimization of Weighted Automata Why Synchronous Tree Substitution Grammars? A Tree Transducer Model for Synchronous Tree-Adjoining Grammars Parsing and Translation Algorithms Based on Weighted Extended Tree Transducers Simulations of Weighted Tree Automata Better Hyper-Minimization — Not as Fast, But Fewer Errors Input Products for Weighted Extended Top-down Tree Transducers Tree Transducers in Machine Translation
2009
Minimization of Deterministic Weighted Tree Automata A Backward and a Forward Simulation for Weighted Tree Automata Minimizing Weighted Tree Grammars using Simulation Compositions of Top-down Tree Transducers with ε-Rules Parsing Algorithms Based on Tree Automata
2008
Minimizing Weighted Tree Automata Minimization of Deterministic Weighted Tree Automata Myhill-Nerode Theorem for Recognizable Tree Series — Revisited Minimization of Weighted Automata Extended Top-down Tree Transducers The Power of Tree Series Transducers Tree-Series-to-Tree-Series Transformations Extended Multi Bottom-up Tree Transducers
2007
Compositions of Extended Top-down Tree Transducers Excursion: Machine Translation Learning Deterministically Recognizable Tree Series — Revisited Learning Deterministically Recognizable Tree Series — Revisited Myhill-Nerode Theorem for Recognizable Tree Series — Revisited
2006
Preservation of Recognizability for O-Substitution A Roadmap of my Thesis: The Power of Tree Series Transducers Weighted Tree Automata over Multioperator Monoids The Power of Tree Series Transducers Introduction to Support Vector Machines Introduction to Weighted Tree Automata and Tree Series Transducers Hierarchies of Tree Series Transducers — Revisited Rational Tree Expressions and Compositions of Tree Series Transformations Weighted Tree Automata over DM-Monoids (Part 2) Does O-Substitution Preserve Recognizability? Tree Transducers in Machine Translation
2004
Bounds for Tree Automata with Polynomial Costs — Part II Relating Tree Transducers and Weighted Tree Automata Relating Tree Series Transducers and Weighted Tree Automata Myhill-Nerode Theorem for Sequential Transducers over GCD-Semirings Compositions of Tree Series Transformations Relating Tree Series Transducers and Weighted Tree Automata Compositions of Tree Series Transformations Relating Tree Series Transducers and Weighted Tree Automata