About: Re-Pair

An Entity of Type: Thing, from Named Graph: http://dbpedia.org, within Data Space: dbpedia.org

Re-Pair (short for Recursive Pairing) 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. 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 is used as the axiom of the grammar. Therefore, the output grammar is such that all rules but the axiom have two symbols on the right-hand side.

Property	Value
dbo:abstract	Re-Pair (short for Recursive Pairing) 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. 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 is used as the axiom of the grammar. Therefore, the output grammar is such that all rules but the axiom have two symbols on the right-hand side. (en)
dbo:thumbnail	wiki-commons:Special:FilePath/Re_pair_example.gif?width=300
dbo:wikiPageExternalLink	https://github.com/rwanwork/Re-Pair https://github.com/syoshid/Re-Pair-VF https://github.com/tkida/MR-Repair https://bitbucket.org/IguanaBen/repairimproved/src/master/ https://code.google.com/archive/p/re-pair/ http://github.com/nicolaprezza/Re-Pair
dbo:wikiPageID	60649045 (xsd:integer)
dbo:wikiPageLength	10747 (xsd:nonNegativeInteger)
dbo:wikiPageRevisionID	1016918981 (xsd:integer)
dbo:wikiPageWikiLink	dbr:Context-free_grammar dbr:Straight-line_program dbc:Lossless_compression_algorithms dbr:Grammar-based_code dbc:Compression_algorithms dbr:Byte_pair_encoding dbr:Variable-length_code dbr:Sequitur_algorithm dbr:File:Re_pair_example.gif dbr:File:Slide00.png dbr:File:Slide01.png dbr:File:Structure_repair.png
dbp:wikiPageUsesTemplate	dbt:Compression_Methods dbt:External_links dbt:Lead_too_long dbt:Multiple_issues dbt:Reflist dbt:Short_description
dcterms:subject	dbc:Lossless_compression_algorithms dbc:Compression_algorithms
rdfs:comment	Re-Pair (short for Recursive Pairing) 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. 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 is used as the axiom of the grammar. Therefore, the output grammar is such that all rules but the axiom have two symbols on the right-hand side. (en)
rdfs:label	Re-Pair (en)
owl:sameAs	wikidata:Re-Pair https://global.dbpedia.org/id/BxDy7
prov:wasDerivedFrom	wikipedia-en:Re-Pair?oldid=1016918981&ns=0
foaf:depiction	wiki-commons:Special:FilePath/Re_pair_example.gif wiki-commons:Special:FilePath/Slide00.png wiki-commons:Special:FilePath/Slide01.png wiki-commons:Special:FilePath/Structure_repair.png
foaf:isPrimaryTopicOf	wikipedia-en:Re-Pair
is dbo:wikiPageRedirects of	dbr:Recursive_Pairing
is dbo:wikiPageWikiLink of	dbr:Data_compression dbr:Grammar-based_code dbr:Byte_pair_encoding dbr:Recursive_Pairing
is foaf:primaryTopic of	wikipedia-en:Re-Pair