Capturing practical natural language transformations
Machine Translation
Compositions of extended top-down tree transducers
Information and Computation
Why synchronous tree substitution grammars?
HLT '10 Human Language Technologies: The 2010 Annual Conference of the North American Chapter of the Association for Computational Linguistics
Efficient inference through cascades of weighted tree transducers
ACL '10 Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics
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
Parsing and translation algorithms based on weighted extended tree transducers
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
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 alternative to synchronous tree substitution grammars*
Natural Language Engineering
Equational tree transformations
Theoretical Computer Science
Syntax-based statistical machine translation using tree automata and tree transducers
HLT-SS '11 Proceedings of the ACL 2011 Student Session
Tree transformations and dependencies
MOL'11 Proceedings of the 12th biennial conference on The mathematics of language
Symbolic finite state transducers: algorithms and applications
POPL '12 Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Equational weighted tree transformations with discounting
Algebraic Foundations in Computer Science
Survey: weighted extended top-down tree transducers part iii - composition
Algebraic Foundations in Computer Science
PSI'11 Proceedings of the 8th international conference on Perspectives of System Informatics
Weighted Extended Tree Transducers
Fundamenta Informaticae
Survey: Weighted Extended Top-down Tree Transducers Part II—Application in Machine Translation
Fundamenta Informaticae - Non-Classical Models of Automata and Applications II
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
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
Semantic parsing with Bayesian tree transducers
ACL '12 Proceedings of the 50th Annual Meeting of the Association for Computational Linguistics: Long Papers - Volume 1
Towards probabilistic acceptors and transducers for feature structures
SSST-6 '12 Proceedings of the Sixth Workshop on Syntax, Semantics and Structure in Statistical Translation
Equivalence of extended symbolic finite transducers
CAV'13 Proceedings of the 25th international conference on Computer Aided Verification
| Hi-index | 0.00 |
Extended top-down tree transducers (transducteurs généralisés descendants; see [A. Arnold and M. Dauchet, Bi-transductions de forêts, in Proceedings of the 3rd International Colloquium on Automata, Languages and Programming, Edinburgh University Press, Edinburgh, 1976, pp. 74-86]) received renewed interest in the field of natural language processing. Here those transducers are extensively and systematically studied. Their main properties are identified and their relation to classical top-down tree transducers is exactly characterized. The obtained properties completely explain the Hasse diagram of the induced classes of tree transformations. In addition, it is shown that most interesting classes of transformations computed by extended top-down tree transducers are not closed under composition.