Weighted grammars and Kleene's theorem
Information Processing Letters
Handbook of formal languages, vol. 3
Term rewriting and all that
On rational series and rational languages
Theoretical Computer Science
The transducers and formal tree series
Acta Cybernetica
Bottom-up and top-down tree series transformations
Journal of Automata, Languages and Combinatorics
Full Abstract Families of Tree Series I
Jewels are Forever, Contributions on Theoretical Computer Science in Honor of Arto Salomaa
Benefits of Tree Transducers for Optimizing Functional Programs
Proceedings of the 18th Conference on Foundations of Software Technology and Theoretical Computer Science
Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the workshop weighted automata: Theory and applications (Dresden University of Technology (Germany), March 4-8, 2002)
Determinization of finite state weighted tree automata
Journal of Automata, Languages and Combinatorics
Hierarchies of tree series transformations
Theoretical Computer Science
A decoder for syntax-based statistical MT
ACL '02 Proceedings of the 40th Annual Meeting on Association for Computational Linguistics
Statistical phrase-based translation
NAACL '03 Proceedings of the 2003 Conference of the North American Chapter of the Association for Computational Linguistics on Human Language Technology - Volume 1
Compositions of tree series transformations
Theoretical Computer Science
Compositions of extended top-down tree transducers
Information and Computation
Extended Multi Bottom-Up Tree Transducers
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
Computational Linguistics
The Power of Extended Top-Down Tree Transducers
SIAM Journal on Computing
Statistical Machine Translation
Statistical Machine Translation
Generalized2 sequential machine maps
Journal of Computer and System Sciences
Efficient inference through cascades of weighted tree transducers
ACL '10 Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics
Compositions of top-down tree transducers with ε-rules
FSMNLP'09 Proceedings of the 8th international conference on Finite-state methods and 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
Survey: Weighted Extended Top-down Tree Transducers Part II—Application in Machine Translation
Fundamenta Informaticae - Non-Classical Models of Automata and Applications II
| Hi-index | 0.00 |
In this survey (functional) compositions of weighted tree transformations computable by weighted extended top-down tree transducers are investigated. The existing results in the literature are explained and illustrated. It is argued, why certain compositions are not possible in the general case, and 3 informed conjectures provide an insight into potentially 3 new composition results that extend and complement the existing results. In particular, if all were true, then the beautiful symmetry in the composition results for weighted top-down and bottom-up tree transducers would be recovered.