Weighted grammars and Kleene's theorem
Information Processing Letters
Handbook of Natural Language Processing
Handbook of Natural Language Processing
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
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)
Determinization of finite state weighted tree automata
Journal of Automata, Languages and Combinatorics
Minimizing nfa's and regular expressions
Journal of Computer and System Sciences
The equivalence problem for regular expressions with squaring requires exponential space
SWAT '72 Proceedings of the 13th Annual Symposium on Switching and Automata Theory (swat 1972)
Forest FIRE and FIRE Wood: Tools for Tree Automata and Tree Algorithms
Proceedings of the 2009 conference on Finite-State Methods and Natural Language Processing: Post-proceedings of the 7th International Workshop FSMNLP 2008
A Backward and a Forward Simulation for Weighted Tree Automata
CAI '09 Proceedings of the 3rd International Conference on Algebraic Informatics
Minimizing deterministic weighted tree automata
Information and Computation
Parsing '05 Proceedings of the Ninth International Workshop on Parsing Technology
Inapproximability of nondeterministic state and transition complexity assuming P ≠ NP
DLT'07 Proceedings of the 11th international conference on Developments in language theory
Bisimulation minimisation for weighted tree automata
DLT'07 Proceedings of the 11th international conference on Developments in language theory
Backward and forward bisimulation minimisation of tree automata
CIAA'07 Proceedings of the 12th international conference on Implementation and application of automata
Computing simulations over tree automata: efficient techniques for reducing tree automata
TACAS'08/ETAPS'08 Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems
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
| Hi-index | 0.00 |
Weighted tree grammars (for short: WTG) are an extension of weighted context-free grammars that generate trees instead of strings. They can be used in natural language parsing to directly generate the parse tree of a sentence or to encode the set of all parse trees of a sentence. Two types of simulations for WTG over idempotent, commutative semirings are introduced. They generalize the existing notions of simulation and bisimulation for WTG. Both simulations can be used to reduce the size of WTG while preserving the semantics, and are thus an important tool in toolkits. Since the new notions are more general than the existing ones, they yield the best reduction rates achievable by all minimization procedures that rely on simulation or bisimulation. However, the existing notions might allow faster minimization.