Handbook of formal languages, vol. 3
The transducers and formal tree series
Acta Cybernetica
Bottom-up and top-down tree series transformations
Journal of Automata, Languages and Combinatorics
Head-driven statistical models for natural language parsing
Head-driven statistical models for natural language parsing
Determinization of finite state weighted tree automata
Journal of Automata, Languages and Combinatorics
Compositions of tree series transformations
Theoretical Computer Science
Computational Linguistics
The Power of Extended Top-Down Tree Transducers
SIAM Journal on Computing
Generalized2 sequential machine maps
Journal of Computer and System Sciences
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
Tiburon: a weighted tree automata toolkit
CIAA'06 Proceedings of the 11th international conference on Implementation and Application of Automata
Tree parsing with synchronous tree-adjoining grammars
IWPT '11 Proceedings of the 12th International Conference on Parsing Technologies
Weighted Extended Tree Transducers
Fundamenta Informaticae
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 |
A weighted tree transformation is a function τ : TΣ×TΔ → A where TΣ and TΔ are the sets of trees over the ranked alphabets Σ and Δ, respectively, and A is the domain of a semiring. The input and output product of τ with tree series ϕ: TΣ → A and ϕ: TΔ → A are the weighted tree transformations ϕ Δ τ and τ Δ Ψ, respectively, which are defined by (ϕ ◃ τ)(t, u) = ϕ(t) ċ τ (t, u) and (τ ▹ ψ)(t, u) = τ (t, u) ċ ψ(u) for every t ∈ TΣ and u ∈ TΔ. In this contribution, input and output products of weighted tree transformations computed by weighted extended top-down tree transducers (wxtt) with recognizable tree series are considered. The classical approach is presented and used to solve the simple cases. It is shown that input products can be computed in three successively more difficult scenarios: nondeleting wxtt, wxtt over idempotent semirings, and weighted top-down tree transducers over rings.