Re-Pair
id:
re-pair-302-18671712
title:
Re-Pair
text:
Re-Pair is a grammar-based compression algorithm that, given an input text, builds a straight-line program, i.e. a context-free grammar generating a single string: the input text. In order to perform the compression in linear time, it consumes the amount of memory that is approximately five times the size of its input. The grammar is built by recursively replacing the most frequent pair of characters occurring in the text. Once there is no pair of characters occurring twice, the resulting string
brand slug:
wiki
category slug:
encyclopedia
description:
Lossless, but memory-consuming, data compression algorithm
original url:
https://en.wikipedia.org/wiki/Re-Pair
date created:
date modified:
2023-08-04T16:39:11Z
main entity:
{"identifier":"Q85796184","url":"https://www.wikidata.org/entity/Q85796184"}
image:
fields total:
13
integrity:
14