Deciding the twins property for weighted tree automata over extremal semifields

Authors:
Matthias Büchse;Anja Fischer
Affiliations:
Technische Universität Dresden, Dresden, Germany;Technische Universität Dresden, Dresden, Germany
Venue:
ATANLP '12 Proceedings of the Workshop on Applications of Tree Automata Techniques in Natural Language Processing
Year:
2012

Citing 14
Cited 0

Finding the k Shortest Paths

SIAM Journal on Computing
Initial Algebra Semantics and Continuous Algebras

Journal of the ACM (JACM)
Computational Complexity of Problems on Probabilistic Grammars and Transducers

ICGI '00 Proceedings of the 5th International Colloquium on Grammatical Inference: Algorithms and Applications
Formal tree series

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)
Computational complexity of probabilistic disambiguation by means of tree-grammars

COLING '96 Proceedings of the 16th conference on Computational linguistics - Volume 2
Learning accurate, compact, and interpretable tree annotation

ACL-44 Proceedings of the 21st International Conference on Computational Linguistics and the 44th annual meeting of the Association for Computational Linguistics
A better N-best list: practical determinization of weighted finite tree automata

HLT-NAACL '06 Proceedings of the main conference on Human Language Technology Conference of the North American Chapter of the Association of Computational Linguistics
Hierarchical Phrase-Based Translation

Computational Linguistics
Training tree transducers

Computational Linguistics
Better k-best parsing

Parsing '05 Proceedings of the Ninth International Workshop on Parsing Technology
Handbook of Weighted Automata

Handbook of Weighted Automata
Variational decoding 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
k-best A* parsing

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
Decidability, undecidability, and PSPACE-completeness of the twins property in the tropical semiring

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

It has remained an open question whether the twins property for weighted tree automata is decidable. This property is crucial for determinizing such an automaton, and it has been argued that determinization improves the output of parsers and translation systems. We show that the twins property for weighted tree automata over extremal semifields is decidable.