Weighted grammars and Kleene's theorem
Information Processing Letters
An efficient probabilistic context-free parsing algorithm that computes prefix probabilities
Computational Linguistics
Automata, Languages, and Machines
Automata, Languages, and Machines
Continuous monoids and semirings
Theoretical Computer Science - Logic, semantics and theory of programming
Capturing practical natural language transformations
Machine Translation
Computational Linguistics
The Power of Extended Top-Down Tree Transducers
SIAM Journal on Computing
Parsing algorithms based on tree automata
IWPT '09 Proceedings of the 11th International Conference on Parsing Technologies
Generalized2 sequential machine maps
Journal of Computer and System Sciences
Preservation of recognizability for synchronous tree substitution grammars
ATANLP '10 Proceedings of the 2010 Workshop on Applications of Tree Automata in Natural Language Processing
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
Error bounds for convolutional codes and an asymptotically optimum decoding algorithm
IEEE Transactions on Information Theory
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 |
An open question in [Fülöp, Maletti, Vogler: Weighted extended tree transducers. Fundamenta Informaticae 111(2), 2011] asks whether weighted linear extended tree transducers preserve recognizability in countably complete commutative semirings. In this contribution, the question is answered positively, which is achieved with a construction that utilizes inside weights. Due to the completeness of the semiring, the inside weights always exist, but the construction is only effective if they can be effectively determined. It is demonstrated how to achieve this in a number of important cases.