Simple linear-time off-line text compression by longest-first substitution

Eyosuke Nakamura; Hideo Bannai; Shunsuke Ineriaga; Masayuki Takeda

doi:10.1109/DCC.2007.70

Simple linear-time off-line text compression by longest-first substitution

Eyosuke Nakamura, Hideo Bannai, Shunsuke Ineriaga, Masayuki Takeda

Mathematical Informatics

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

7 Citations (Scopus)

Abstract

We consider grammar based text compression with longest first substitution where non-overlapping occurrences of a longest repeating substring of the input text are replaced by a new non-terminal symbol. We present a new text compression algorithm by simplifying the algorithm presented in [4]. We give a new formulation of the correctness proof introducing the sparse lazy suffix tree data structure. We also present another type of longest first substitution strategy that allows better compression. We show results of preliminary experiments comparing grammar sizes of the two versions of the longest first strategy and the most frequent strategy.

Original language	English
Title of host publication	Proceedings - DCC 2007: 2007 Data Compression Conference
Pages	123-132
Number of pages	10
DOIs	https://doi.org/10.1109/DCC.2007.70
Publication status	Published - 2007
Event	DCC 2007: 2007 Data Compression Conference - Snowbird, UT, United States Duration: Mar 27 2007 → Mar 29 2007

Other

Other	DCC 2007: 2007 Data Compression Conference
Country/Territory	United States
City	Snowbird, UT
Period	3/27/07 → 3/29/07

All Science Journal Classification (ASJC) codes

Electrical and Electronic Engineering
Hardware and Architecture

Access to Document

10.1109/DCC.2007.70

Cite this

@inproceedings{3a336c30421149cc8d33ad9ac83ba10c,

title = "Simple linear-time off-line text compression by longest-first substitution",

abstract = "We consider grammar based text compression with longest first substitution where non-overlapping occurrences of a longest repeating substring of the input text are replaced by a new non-terminal symbol. We present a new text compression algorithm by simplifying the algorithm presented in [4]. We give a new formulation of the correctness proof introducing the sparse lazy suffix tree data structure. We also present another type of longest first substitution strategy that allows better compression. We show results of preliminary experiments comparing grammar sizes of the two versions of the longest first strategy and the most frequent strategy.",

author = "Eyosuke Nakamura and Hideo Bannai and Shunsuke Ineriaga and Masayuki Takeda",

year = "2007",

doi = "10.1109/DCC.2007.70",

language = "English",

isbn = "0769527914",

pages = "123--132",

booktitle = "Proceedings - DCC 2007: 2007 Data Compression Conference",

note = "DCC 2007: 2007 Data Compression Conference ; Conference date: 27-03-2007 Through 29-03-2007",

}

TY - GEN

T1 - Simple linear-time off-line text compression by longest-first substitution

AU - Nakamura, Eyosuke

AU - Bannai, Hideo

AU - Ineriaga, Shunsuke

AU - Takeda, Masayuki

PY - 2007

Y1 - 2007

N2 - We consider grammar based text compression with longest first substitution where non-overlapping occurrences of a longest repeating substring of the input text are replaced by a new non-terminal symbol. We present a new text compression algorithm by simplifying the algorithm presented in [4]. We give a new formulation of the correctness proof introducing the sparse lazy suffix tree data structure. We also present another type of longest first substitution strategy that allows better compression. We show results of preliminary experiments comparing grammar sizes of the two versions of the longest first strategy and the most frequent strategy.

AB - We consider grammar based text compression with longest first substitution where non-overlapping occurrences of a longest repeating substring of the input text are replaced by a new non-terminal symbol. We present a new text compression algorithm by simplifying the algorithm presented in [4]. We give a new formulation of the correctness proof introducing the sparse lazy suffix tree data structure. We also present another type of longest first substitution strategy that allows better compression. We show results of preliminary experiments comparing grammar sizes of the two versions of the longest first strategy and the most frequent strategy.

UR - http://www.scopus.com/inward/record.url?scp=34547638395&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=34547638395&partnerID=8YFLogxK

U2 - 10.1109/DCC.2007.70

DO - 10.1109/DCC.2007.70

M3 - Conference contribution

AN - SCOPUS:34547638395

SN - 0769527914

SN - 9780769527918

SP - 123

EP - 132

BT - Proceedings - DCC 2007: 2007 Data Compression Conference

T2 - DCC 2007: 2007 Data Compression Conference

Y2 - 27 March 2007 through 29 March 2007

ER -

Simple linear-time off-line text compression by longest-first substitution

Abstract

Other

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this