Handbook of formal languages, vol. 3
The theory of parsing, translation, and compiling
The theory of parsing, translation, and compiling
Synchronous tree-adjoining grammars
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 3
A hierarchical phrase-based model for statistical machine translation
ACL '05 Proceedings of the 43rd Annual Meeting on Association for Computational Linguistics
Capturing practical natural language transformations
Machine Translation
Compositions of extended top-down tree transducers
Information and Computation
Computational Linguistics
SSST '07 Proceedings of the NAACL-HLT 2007/AMTA Workshop on Syntax and Structure in Statistical Translation
Parsing '05 Proceedings of the Ninth International Workshop on Parsing Technology
The Power of Extended Top-Down Tree Transducers
SIAM Journal on Computing
IWPT '09 Proceedings of the 11th International Conference on Parsing Technologies
Generalized2 sequential machine maps
Journal of Computer and System Sciences
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
Syntax-based statistical machine translation using tree automata and tree transducers
HLT-SS '11 Proceedings of the ACL 2011 Student Session
A generalized view on parsing and translation
IWPT '11 Proceedings of the 12th International Conference on Parsing Technologies
Tree parsing with synchronous tree-adjoining grammars
IWPT '11 Proceedings of the 12th International Conference on Parsing Technologies
Unidirectional derivation semantics for synchronous tree-adjoining grammars
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
Hi-index | 0.00 |
A characterization of the expressive power of synchronous tree-adjoining grammars (STAGs) in terms of tree transducers (or equivalently, synchronous tree substitution grammars) is developed. Essentially, a STAG corresponds to an extended tree transducer that uses explicit substitution in both the input and output. This characterization allows the easy integration of STAG into toolkits for extended tree transducers. Moreover, the applicability of the characterization to several representational and algorithmic problems is demonstrated.