Re-Store Software

Re-Store is a phrase browsing system based on the Re-Pair compression algorithm that consists of several components and described by:

The Re-Pair compression algorithm is described in N. J. Larsson's PhD thesis and:

The Re-Merge compression algorithm was most recently described in:

An entropy coder is required to encode the modifiers or the sequence (one of the outputs from Re-Pair). The one used in the original Re-Pair paper and the Re-Merge paper was the Minimum-Redundancy (Huffman) coder by Andrew Turpin and Alistair Moffat.

The software below is released under the GNU Public License. In addition, as a courtesy to me, I would appreciate it if you let me know if you found any bugs or have any comments or suggestions. Thank you!

Previous page