Composing extended top-down tree transducers

Authors:
Aurélie Lagoutte;Fabienne Braune;Daniel Quernheim;Andreas Maletti
Affiliations:
École normale supérieure de Cachan;University of Stuttgart, Institute for Natural Language Processing;University of Stuttgart, Institute for Natural Language Processing;University of Stuttgart, Institute for Natural Language Processing
Venue:
EACL '12 Proceedings of the 13th Conference of the European Chapter of the Association for Computational Linguistics
Year:
2012

Citing 16
Cited 0

A Machine-Oriented Logic Based on the Resolution Principle

Journal of the ACM (JACM)
An Efficient Unification Algorithm

ACM Transactions on Programming Languages and Systems (TOPLAS)
A syntax-based statistical translation model

ACL '01 Proceedings of the 39th Annual Meeting on Association for Computational Linguistics
Learning non-isomorphic tree mappings for machine translation

ACL '03 Proceedings of the 41st Annual Meeting on Association for Computational Linguistics - Volume 2
Capturing practical natural language transformations

Machine Translation
Training tree transducers

Computational Linguistics
The Power of Extended Top-Down Tree Transducers

SIAM Journal on Computing
Extended multi bottom–up tree transducers: Composition and decomposition

Acta Informatica
Generalized2 sequential machine maps

Journal of Computer and System Sciences
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
Efficient inference through cascades of weighted tree transducers

ACL '10 Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics
Compositions of top-down tree transducers with ε-rules

FSMNLP'09 Proceedings of the 8th international conference on Finite-state methods and natural language processing
Weighted tree automata and transducers for syntactic natural language processing

Weighted tree automata and transducers for syntactic natural language processing
An alternative to synchronous tree substitution grammars*

Natural Language Engineering
Tiburon: a weighted tree automata toolkit

CIAA'06 Proceedings of the 11th international conference on Implementation and Application of Automata
An overview of probabilistic tree transducers for natural language processing

CICLing'05 Proceedings of the 6th international conference on Computational Linguistics and Intelligent Text Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

A composition procedure for linear and nondeleting extended top-down tree transducers is presented. It is demonstrated that the new procedure is more widely applicable than the existing methods. In general, the result of the composition is an extended top-down tree transducer that is no longer linear or nondeleting, but in a number of cases these properties can easily be recovered by a post-processing step.