Regular models of phonological rule systems
Computational Linguistics - Special issue on computational phonology
Handbook of formal languages, vol. 3
A design principles of a weighted finite-state transducer library
Theoretical Computer Science - Special issue on implementing automata
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Full Abstract Families of Tree Series I
Jewels are Forever, Contributions on Theoretical Computer Science in Honor of Arto Salomaa
Proprietes de Cloture d'une Extension de Transducteurs d'Arbres Deterministes
CAAP '81 Proceedings of the 6th Colloquium on Trees in Algebra and Programming
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
A bottom-up characterization of deterministic top-down tree transducers with regular look-ahead
Information Processing Letters - Devoted to the rapid publication of short contributions to information processing
A decoder for syntax-based statistical MT
ACL '02 Proceedings of the 40th Annual Meeting on Association for Computational Linguistics
Linear deterministic multi bottom-up tree transducers
Theoretical Computer Science
FSA: an efficient and flexible C++ toolkit for finite state automata using on-demand computation
ACL '04 Proceedings of the 42nd Annual Meeting on Association for Computational Linguistics
Capturing practical natural language transformations
Machine Translation
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
Generalized2 sequential machine maps
Journal of Computer and System Sciences
OpenFst: a general and efficient weighted finite-state transducer library
CIAA'07 Proceedings of the 12th international conference on Implementation and application of automata
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
Survey: weighted extended top-down tree transducers part iii - composition
Algebraic Foundations in Computer Science
Composing extended top-down tree transducers
EACL '12 Proceedings of the 13th Conference of the European Chapter of the Association for Computational Linguistics
| Hi-index | 0.00 |
Top-down tree transducers with ε-rules (etdtts) are a restricted version of extended top-down tree transducers. They are implemented in the framework TIBURON and fulfill some criteria desirable in a machine translation model. However, they compute a class of transformations that is not closed under composition (not even for linear and nondeleting etdtts). A composition construction that composes two εtdtts M and N is presented, and it is shown that the construction is correct, whenever (i) N is linear, (ii) M is total or N is nondeleting, and (iii) M has at most one output symbol in each rule.