Handbook of formal languages, vol. 3: beyond words
Handbook of formal languages, vol. 3: beyond words
Handbook of formal languages, vol. 3
Handbook of formal languages, vol. 3
The theory of parsing, translation, and compiling
The theory of parsing, translation, and compiling
Mathematical and computational aspects of lexicalized grammars
Mathematical and computational aspects of lexicalized grammars
Synchronous tree-adjoining grammars
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 3
Hierarchical Phrase-Based Translation
Computational Linguistics
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
Statistical Machine Translation
Statistical Machine Translation
Generalized2 sequential machine maps
Journal of Computer and System Sciences
A tree transducer model for synchronous tree-adjoining grammars
ACL '10 Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics
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
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
Tree parsing with synchronous tree-adjoining grammars
IWPT '11 Proceedings of the 12th International Conference on Parsing Technologies
| Hi-index | 0.00 |
Synchronous tree-adjoining grammars have been given two types of semantics: one based on bimorphisms and one based on synchronous derivations, in both of which the input and output trees are constructed synchronously. We introduce a third type of semantics that is based on unidirectional derivations. It derives output trees based on a given input tree and thus marks a first step towards conditional probability distributions. We prove that the unidirectional semantics coincides with the bimorphism-based semantics with the help of a strong correspondence to linear and nondeleting extended top-down tree transducers with explicit substitution. In addition, we show that stateful synchronous tree-adjoining grammars admit a normal form in which only adjunction is used. This contrasts the situation encountered in the stateless case.