Weight Computation of Regular Tree Languages
Jochen Burghardt
TL;DR
This paper introduces a flexible framework for assigning application-specific weights to terms in regular tree languages and provides an efficient algorithm for computing minimal weights across nonterminals.
Contribution
It presents a novel general framework for weight measures on terms and an O(n log n) algorithm for minimal weight computation in regular tree grammars.
Findings
Framework unifies various weight measures like simplification orders
Algorithm efficiently computes minimal weights for all nonterminals
Applicable to diverse applications involving regular tree languages
Abstract
We present a general framework to define an application-dependent weight measure on terms that subsumes e.g. total simplification orderings, and an O(n log n) algorithm for the simultaneous computation of the minimal weight of a term in the language of each nonterminal of a regular tree grammar, based on Barzdins' liquid-flow technique.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicssemigroups and automata theory · Natural Language Processing Techniques · Algorithms and Data Compression