Proceedings of the 15th Annual Conference on Genetic and Evolutionary Computation 2013
DOI: 10.1145/2463372.2463441
|View full text |Cite
|
Sign up to set email alerts
|

An effective heuristic for the smallest grammar problem

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
11
0

Year Published

2016
2016
2023
2023

Publication Types

Select...
3
2
2

Relationship

0
7

Authors

Journals

citations
Cited by 8 publications
(11 citation statements)
references
References 16 publications
0
11
0
Order By: Relevance
“…Occurrence optimisation addressed an issue present in all IRR algorithms, and consistently smaller models were produced by ZZ relative to IRR-Mx across inputs of varying size. Benz and Kötzing's GA-MMAS algorithm Benz and Kötzing (2013) used heuristics in its traversal of the same search space as ZZ, enabling it to construct grammars of equal size in fewer parses. Siyari and Gallé (2017) introduced the concept of flexible matching, where terms to be replaced within the input string were not limited to those which exactly repeat, but instead constructed from a pattern uwv where w was allowed to vary so that only the prefix u and suffix v of each pattern were equal.…”
Section: Grammars and Compressorsmentioning
confidence: 99%
“…Occurrence optimisation addressed an issue present in all IRR algorithms, and consistently smaller models were produced by ZZ relative to IRR-Mx across inputs of varying size. Benz and Kötzing's GA-MMAS algorithm Benz and Kötzing (2013) used heuristics in its traversal of the same search space as ZZ, enabling it to construct grammars of equal size in fewer parses. Siyari and Gallé (2017) introduced the concept of flexible matching, where terms to be replaced within the input string were not limited to those which exactly repeat, but instead constructed from a pattern uwv where w was allowed to vary so that only the prefix u and suffix v of each pattern were equal.…”
Section: Grammars and Compressorsmentioning
confidence: 99%
“…As defined in Section 2.2, the rule-size also takes the number of rules into account. In fact, the literature on grammar-based compression is inconsistent with respect to which kind of size is used, e. g., in [6,8,15,33,34,34,41], the size of a grammar coincides with our definition | • |, while in [4,[53][54][55], the rule-size is used. The rule-size seems to be mainly motivated by the question of how a grammar is encoded as a single string, which, in any reasonable way, requires an additional symbol per rule.…”
Section: Theorem 4 Sgp Opt Is Apx-hard Even For Alphabets Of Size 24mentioning
confidence: 99%
“…Despite its simplicity, BPE performs very well in standard compression benchmarks (Gage, 1994;Carrascosa et al, 2012). The best performing ones have an unreasonable time-complexity (including one of complexity O(n 7 ) (Carrascosa et al, 2011) and an even slower genetic algorithm (Benz and Kötzing, 2013)). Based on these benchmarks, we decided to use the so-called IRRMGP algorithm, which outperforms BPE, as well as other worse performing algorithms.…”
Section: Other Compression Algorithmsmentioning
confidence: 99%