Abstract
We analyze the grammar generation algorithm of the RePair compression algorithm and show the relation between a grammar generated by RePair and maximal repeats. We reveal that RePair replaces step by step the most frequent pairs within the corresponding most frequent maximal repeats. Then, we design a novel variant of RePair, called MR-RePair, which substitutes the most frequent maximal repeats at once instead of substituting the most frequent pairs consecutively. We implemented MR-RePair and compared the size of the grammar generated by MR-RePair to that by RePair on several text corpora. Our experiments show that MR-RePair generates more compact grammars than RePair does, especially for highly repetitive texts.
| Original language | English |
|---|---|
| Title of host publication | Proceedings - DCC 2019 |
| Subtitle of host publication | 2019 Data Compression Conference |
| Editors | Joan Serra-Sagrista, Ali Bilgin, Michael W. Marcellin, James A. Storer |
| Publisher | Institute of Electrical and Electronics Engineers Inc. |
| Pages | 508-517 |
| Number of pages | 10 |
| ISBN (Electronic) | 9781728106571 |
| DOIs | |
| Publication status | Published - May 10 2019 |
| Event | 2019 Data Compression Conference, DCC 2019 - Snowbird, United States Duration: Mar 26 2019 → Mar 29 2019 |
Publication series
| Name | Data Compression Conference Proceedings |
|---|---|
| Volume | 2019-March |
| ISSN (Print) | 1068-0314 |
Conference
| Conference | 2019 Data Compression Conference, DCC 2019 |
|---|---|
| Country | United States |
| City | Snowbird |
| Period | 3/26/19 → 3/29/19 |
Fingerprint
All Science Journal Classification (ASJC) codes
- Computer Networks and Communications
Cite this
MR-RePair : Grammar Compression Based on Maximal Repeats. / Furuya, Isamu; Takagi, Takuya; Nakashima, Yuto; Inenaga, Shunsuke; Bannai, Hideo; Kida, Takuya.
Proceedings - DCC 2019: 2019 Data Compression Conference. ed. / Joan Serra-Sagrista; Ali Bilgin; Michael W. Marcellin; James A. Storer. Institute of Electrical and Electronics Engineers Inc., 2019. p. 508-517 8712661 (Data Compression Conference Proceedings; Vol. 2019-March).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
}
TY - GEN
T1 - MR-RePair
T2 - Grammar Compression Based on Maximal Repeats
AU - Furuya, Isamu
AU - Takagi, Takuya
AU - Nakashima, Yuto
AU - Inenaga, Shunsuke
AU - Bannai, Hideo
AU - Kida, Takuya
PY - 2019/5/10
Y1 - 2019/5/10
N2 - We analyze the grammar generation algorithm of the RePair compression algorithm and show the relation between a grammar generated by RePair and maximal repeats. We reveal that RePair replaces step by step the most frequent pairs within the corresponding most frequent maximal repeats. Then, we design a novel variant of RePair, called MR-RePair, which substitutes the most frequent maximal repeats at once instead of substituting the most frequent pairs consecutively. We implemented MR-RePair and compared the size of the grammar generated by MR-RePair to that by RePair on several text corpora. Our experiments show that MR-RePair generates more compact grammars than RePair does, especially for highly repetitive texts.
AB - We analyze the grammar generation algorithm of the RePair compression algorithm and show the relation between a grammar generated by RePair and maximal repeats. We reveal that RePair replaces step by step the most frequent pairs within the corresponding most frequent maximal repeats. Then, we design a novel variant of RePair, called MR-RePair, which substitutes the most frequent maximal repeats at once instead of substituting the most frequent pairs consecutively. We implemented MR-RePair and compared the size of the grammar generated by MR-RePair to that by RePair on several text corpora. Our experiments show that MR-RePair generates more compact grammars than RePair does, especially for highly repetitive texts.
UR - http://www.scopus.com/inward/record.url?scp=85066340305&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85066340305&partnerID=8YFLogxK
U2 - 10.1109/DCC.2019.00059
DO - 10.1109/DCC.2019.00059
M3 - Conference contribution
AN - SCOPUS:85066340305
T3 - Data Compression Conference Proceedings
SP - 508
EP - 517
BT - Proceedings - DCC 2019
A2 - Serra-Sagrista, Joan
A2 - Bilgin, Ali
A2 - Marcellin, Michael W.
A2 - Storer, James A.
PB - Institute of Electrical and Electronics Engineers Inc.
ER -