Weighted grammars and Kleene's theorem
Information Processing Letters
The transducers and formal tree series
Acta Cybernetica
A design principles of a weighted finite-state transducer library
Theoretical Computer Science - Special issue on implementing automata
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)
Computational Linguistics
Finite-state transducers in language and speech processing
Computational Linguistics
A syntax-based statistical translation model
ACL '01 Proceedings of the 39th Annual Meeting on Association for Computational Linguistics
Compositions of tree series transformations
Theoretical Computer Science
Compositions of extended top-down tree transducers
Information and Computation
Parsing '05 Proceedings of the Ninth International Workshop on Parsing Technology
The Power of Extended Top-Down Tree Transducers
SIAM Journal on Computing
ACL '09 Proceedings of the Joint Conference of the 47th Annual Meeting of the ACL and the 4th International Joint Conference on Natural Language Processing of the AFNLP: Volume 2 - Volume 2
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
Pushing for weighted tree automata
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
Survey: weighted extended top-down tree transducers part iii - composition
Algebraic Foundations in Computer Science
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 |
Weighted tree transducers have been proposed as useful formal models for representing syntactic natural language processing applications, but there has been little description of inference algorithms for these automata beyond formal foundations. We give a detailed description of algorithms for application of cascades of weighted tree transducers to weighted tree acceptors, connecting formal theory with actual practice. Additionally, we present novel on-the-fly variants of these algorithms, and compare their performance on a syntax machine translation cascade based on (Yamada and Knight, 2001).