Weighted grammars and Kleene's theorem
Information Processing Letters
A statistical approach to machine translation
Computational Linguistics
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
Bottom-up and top-down tree series transformations
Journal of Automata, Languages and Combinatorics
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
Parsing and translation algorithms based on weighted extended tree transducers
ATANLP '10 Proceedings of the 2010 Workshop on Applications of Tree Automata in Natural Language Processing
Tree transformations and dependencies
MOL'11 Proceedings of the 12th biennial conference on The mathematics of language
Weighted Extended Tree Transducers
Fundamenta Informaticae
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
| Hi-index | 0.00 |
Synchronous tree substitution grammars (stsg) are a (formal) tree transformation model that is used in the area of syntax-based machine translation. A competitor that is at least as expressive as stsg is proposed and compared to stsg. The competitor is the extended multi bottom-up tree transducer (mbot), which is the bottom-up analogue with the additional feature that states have non-unary ranks. Unweighted mbot have already been investigated with respect to their basic properties, but the particular properties of the constructions that are required in the machine translation task are largely unknown. stsg and mbot are compared with respect to binarization, regular restriction, and application. Particular attention is paid to the complexity of the constructions.