Semirings, automata, languages
Semirings, automata, languages
Learning regular sets from queries and counterexamples
Information and Computation
Deciding equivalence of finite tree automata
SIAM Journal on Computing
Handbook of formal languages, vol. 3
Minimization algorithms for sequential transducers
Theoretical Computer Science
Determinization of finite state weighted tree automata
Journal of Automata, Languages and Combinatorics
Simpler and more general minimization for weighted finite-state automata
NAACL '03 Proceedings of the 2003 Conference of the North American Chapter of the Association for Computational Linguistics on Human Language Technology - Volume 1
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
Learning deterministically recognizable tree series
Journal of Automata, Languages and Combinatorics
OpenFst: a general and efficient weighted finite-state transducer library
CIAA'07 Proceedings of the 12th international conference on Implementation and application of automata
Learning deterministically recognizable tree series: revisited
CAI'07 Proceedings of the 2nd international conference on Algebraic informatics
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
FIRE station: an environment for manipulating finite automata and regular expression views
CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata
Learning multiplicity tree automata
ICGI'06 Proceedings of the 8th international conference on Grammatical Inference: algorithms and applications
| Hi-index | 0.00 |
The problem of efficiently minimizing deterministic weighted tree automata (wta) is investigated. Such automata have found promising applications as language models in Natural Language Processing. A polynomial-time algorithm is presented that given a deterministic wta over a commutative semifield, of which all operations including the computation of the inverses are polynomial, constructs an equivalent minimal (with respect to the number of states) deterministic and total wta. If the semifield operations can be performed in constant time, then the algorithm runs in time O(rmn4) where ris the maximal rank of the input symbols, mis the number of transitions, and nis the number of states of the input wta.