A new algorithm computes Re-Pair, a grammar-based compression method, in O(n^2) time using roughly text-sized working space, but the core frequency-counting proof appears to overcount repeated-character bigrams.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2019 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
Re-Pair In Small Space
A new algorithm computes Re-Pair, a grammar-based compression method, in O(n^2) time using roughly text-sized working space, but the core frequency-counting proof appears to overcount repeated-character bigrams.