Stable local consistency lets independently built locally consistent grammars be merged into one equivalent grammar, enabling LCG, a parallel compressor that handles 7.9 TB with 0.43 bits per symbol of working memory.
The smallest grammar problem
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2024 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Efficient terabyte-scale text compression via stable local consistency and parallel grammar processing
Stable local consistency lets independently built locally consistent grammars be merged into one equivalent grammar, enabling LCG, a parallel compressor that handles 7.9 TB with 0.43 bits per symbol of working memory.