Semirings, automata, languages
Semirings, automata, languages
Weighted grammars and Kleene's theorem
Information Processing Letters
Handbook of formal languages, vol. 3
On rational series and rational languages
Theoretical Computer Science
The transducers and formal tree series
Acta Cybernetica
Automata, Languages, and Machines
Automata, Languages, and Machines
Syntax-Directed Semantics: Formal Models Based on Tree Transducers
Syntax-Directed Semantics: Formal Models Based on Tree Transducers
Bottom-up and top-down tree series transformations
Journal of Automata, Languages and Combinatorics
Typechecking for XML transformers
Journal of Computer and System Sciences - Special issue on PODS 2000
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)
Synchronous tree-adjoining grammars
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 3
Continuous monoids and semirings
Theoretical Computer Science - Logic, semantics and theory of programming
A syntax-based statistical translation model
ACL '01 Proceedings of the 39th Annual Meeting on Association for Computational Linguistics
Learning non-isomorphic tree mappings for machine translation
ACL '03 Proceedings of the 41st Annual Meeting on Association for Computational Linguistics - Volume 2
Compositions of tree series transformations
Theoretical Computer Science
Capturing practical natural language transformations
Machine Translation
Compositions of extended top-down tree transducers
Information and Computation
Computational Linguistics
Grammar comparison study for translational equivalence modeling and statistical machine translation
COLING '08 Proceedings of the 22nd International Conference on Computational Linguistics - Volume 1
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
Handbook of Weighted Automata
A non-contiguous tree sequence alignment-based model for statistical machine translation
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
Parsing algorithms based on tree automata
IWPT '09 Proceedings of the 11th International Conference on Parsing Technologies
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
Preservation of recognizability for synchronous tree substitution grammars
ATANLP '10 Proceedings of the 2010 Workshop on Applications of Tree Automata in Natural Language Processing
Input products for weighted extended top-down tree transducers
DLT'10 Proceedings of the 14th international conference on Developments in language theory
An alternative to synchronous tree substitution grammars*
Natural Language Engineering
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
Hierarchies of tree series transformations revisited
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
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
Preservation of recognizability for weighted linear extended top-down tree transducers
ATANLP '12 Proceedings of the Workshop on Applications of Tree Automata Techniques in Natural Language Processing
| Hi-index | 0.00 |
Weighted extended tree transducers (wxtts) over countably complete semirings are systematically explored. It is proved that the extension in the left-hand sides of a wxtt can be simulated by the inverse of a linear and nondeleting tree homomorphism. In addition, a characterization of the class of weighted tree transformations computable by bottom-up wxtts in terms of bimorphisms is provided. Backward and forward application to recognizable weighted tree languages are standard operations for wxtts. It is shown that the backward application of a linear wxtt preserves recognizability and that the domain of an arbitrary bottom-up wxtt is recognizable. Examples demonstrate that neither backward nor forward application of arbitrary wxtts preserves recognizability. Finally, a HASSE diagram relates most of the important subclasses of weighted tree transformations computable by wxtts.