Parsing and translation algorithms based on weighted extended tree transducers

Authors:
Andreas Maletti;Giorgio Satta
Affiliations:
Universitat Rovira i Virgili, Tarragona, Spain;University of Padua, Padua, Italy
Venue:
ATANLP '10 Proceedings of the 2010 Workshop on Applications of Tree Automata in Natural Language Processing
Year:
2010

Citing 11
Cited 2

An efficient context-free parsing algorithm

Communications of the ACM
Automata, Languages, and Machines

Automata, Languages, and Machines
Bottom-up and top-down tree series transformations

Journal of Automata, Languages and Combinatorics
Proprietes de Cloture d'une Extension de Transducteurs d'Arbres Deterministes

CAAP '81 Proceedings of the 6th Colloquium on Trees in Algebra and Programming
Some computational complexity results for synchronous context-free grammars

HLT '05 Proceedings of the conference on Human Language Technology and Empirical Methods in Natural Language Processing
Synchronous binarization for machine translation

HLT-NAACL '06 Proceedings of the main conference on Human Language Technology Conference of the North American Chapter of the Association of Computational Linguistics
Factoring synchronous grammars by sorting

COLING-ACL '06 Proceedings of the COLING/ACL on Main conference poster sessions
Capturing practical natural language transformations

Machine Translation
Training tree transducers

Computational Linguistics
The Power of Extended Top-Down Tree Transducers

SIAM Journal on Computing
First- and second-order expectation semirings with applications to minimum-risk training on translation forests

EMNLP '09 Proceedings of the 2009 Conference on Empirical Methods in Natural Language Processing: Volume 1 - Volume 1

An alternative to synchronous tree substitution grammars*

Natural Language Engineering
Survey: Weighted Extended Top-down Tree Transducers Part II—Application in Machine Translation

Fundamenta Informaticae - Non-Classical Models of Automata and Applications II

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper proposes a uniform framework for the development of parsing and translation algorithms for weighted extended (top-down) tree transducers and input strings. The asymptotic time complexity of these algorithms can be improved in practice by exploiting an algorithm for rule factorization in the above transducers.