Extended multi bottom–up tree transducers: Composition and decomposition

Authors:
Joost Engelfriet;Eric Lilin;Andreas Maletti
Affiliations:
Leiden University, Leiden Institute of Advanced Computer Science, P. O. Box 9512, 2300 RA, Leiden, The Netherlands;Université des Sciences et Technologies de Lille, UFR IEEA, 59655, Villeneuve d’Ascq, France;International Computer Science Institute, 1947 Center Street, Suite 600, 94704, Berkeley, CA, USA and Universitat Rovira i Virgili, Departament de Filologies Romàniques, Av. Catalunya 35, 4 ...
Venue:
Acta Informatica
Year:
2009

Citing 0
Cited 12

Why synchronous tree substitution grammars?

HLT '10 Human Language Technologies: The 2010 Annual Conference of the North American Chapter of the Association for Computational Linguistics
Preservation of recognizability for synchronous tree substitution grammars

ATANLP '10 Proceedings of the 2010 Workshop on Applications of Tree Automata in Natural Language Processing
Input products for weighted extended top-down tree transducers

DLT'10 Proceedings of the 14th international conference on Developments in language theory
An alternative to synchronous tree substitution grammars*

Natural Language Engineering
How to train your multi bottom-up tree transducer

HLT '11 Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies - Volume 1
Tree transformations and dependencies

MOL'11 Proceedings of the 12th biennial conference on The mathematics of language
Survey: weighted extended top-down tree transducers part iii - composition

Algebraic Foundations in Computer Science
Weighted Extended Tree Transducers

Fundamenta Informaticae
Survey: Weighted Extended Top-down Tree Transducers Part II—Application in Machine Translation

Fundamenta Informaticae - Non-Classical Models of Automata and Applications II
Composing extended top-down tree transducers

EACL '12 Proceedings of the 13th Conference of the European Chapter of the Association for Computational Linguistics
Every sensible extended top-down tree transducer is a multi bottom-up tree transducer

NAACL HLT '12 Proceedings of the 2012 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies
Second position clitics and monadic second-order transduction

ATANLP '12 Proceedings of the Workshop on Applications of Tree Automata Techniques in Natural Language Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Extended multi bottom–up tree transducers are defined and investigated. They are an extension of multi bottom–up tree transducers by arbitrary, not just shallow, left-hand sides of rules; this includes rules that do not consume input. It is shown that such transducers, even linear ones, can compute all transformations that are computed by linear extended top–down tree transducers, which are a theoretical model for syntax-based machine translation. Moreover, the classical composition results for bottom–up tree transducers are generalized to extended multi bottom–up tree transducers. Finally, characterizations in terms of extended top–down tree transducers and tree bimorphisms are presented.