The Power of Weighted Regularity-Preserving Multi Bottom-Up Tree Transducers

DOI10.1142/S0129054115400109zbMath1367.68173MaRDI QIDQ5744132

Andreas Maletti

Publication date: 17 February 2016

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

zbMATH Keywords

compositionregular tree languagetree transducertopicalization

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (2)

Compositions of Tree-to-Tree Statistical Machine Translation Models ⋮ Compositions of Tree-to-Tree Statistical Machine Translation Models

Cites Work

• Extended multi bottom-up tree transducers
• Tree transducers, L systems, and two-way machines
• Recognizable formal power series on trees
• Morphismes et bimorphismes d'arbres
• Undecidable properties of deterministic top-down tree transducers
• Hierarchies of tree series transformations
• Syntax directed translations and the pushdown assembler
• The Alignment Template Approach to Statistical Machine Translation
• Hierarchical Phrase-Based Translation
• The Power of Extended Top-Down Tree Transducers

This page was built for publication: The Power of Weighted Regularity-Preserving Multi Bottom-Up Tree Transducers