A statistical approach to machine translation
Computational Linguistics
Undecidable properties of deterministic top-down tree transducers
Theoretical Computer Science
Automata, Languages, and Machines
Automata, Languages, and Machines
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
The theory of parsing, translation, and compiling
The theory of parsing, translation, and compiling
Recursively Defined Tree Transductions
RTA '93 Proceedings of the 5th International Conference on Rewriting Techniques and Applications
Proprietes de Cloture d'une Extension de Transducteurs d'Arbres Deterministes
CAAP '81 Proceedings of the 6th Colloquium on Trees in Algebra and Programming
The mathematics of statistical machine translation: parameter estimation
Computational Linguistics - Special issue on using large corpora: II
A hierarchical phrase-based model for statistical machine translation
ACL '05 Proceedings of the 43rd Annual Meeting on Association for Computational Linguistics
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
Computation of distances for regular and context-free probabilistic languages
Theoretical Computer Science
Capturing practical natural language transformations
Machine Translation
Computational Linguistics
Efficient parsing for transducer grammars
NAACL '09 Proceedings of Human Language Technologies: The 2009 Annual Conference of the North American Chapter of the Association for Computational Linguistics
The Power of Extended Top-Down Tree Transducers
SIAM Journal on Computing
Asynchronous binarization for synchronous grammars
ACLShort '09 Proceedings of the ACL-IJCNLP 2009 Conference Short Papers
Binarization of synchronous context-free grammars
Computational Linguistics
Parsing algorithms based on tree automata
IWPT '09 Proceedings of the 11th International Conference on Parsing Technologies
Preservation of recognizability for synchronous tree substitution grammars
ATANLP '10 Proceedings of the 2010 Workshop on Applications of Tree Automata in Natural Language Processing
A decoder for probabilistic synchronous tree insertion 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
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
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
TTT: a tree transduction language for syntactic and semantic processing
ATANLP '12 Proceedings of the Workshop on Applications of Tree Automata Techniques in Natural Language Processing
| Hi-index | 0.00 |
Synchronous tree substitution grammars are a translation model that is used in syntax-based machine translation. They are investigated in a formal setting and compared to a competitor that is at least as expressive. The competitor is the extended multi bottom-up tree transducer, which is the bottom-up analogue with one essential additional feature. This model has been investigated in theoretical computer science, but seems widely unknown in natural language processing. The two models are compared with respect to standard algorithms (binarization, regular restriction, composition, application). Particular attention is paid to the complexity of the algorithms.