Optimal Parsing in Dictionary-Symbolwise Data Compression Schemes

Dictionary-Symbolwise Flexible Parsing

Linear time optimal parsing algorithms are very rare in the dictionary based branch of the data compression theory. The most recent is the Flexible Parsing algorithm of Mathias and Shainalp that works when the dictionary is prefix closed and the encoding of dictionary pointers has a constant cost. We present the Dictionary-Symbolwise Flexible Parsing algorithm that is optimal for prefix-closed ...

On the optimality of parsing in dynamic dictionary based data compression preliminary version

Since the introduction of dynamic dictionary based data compression by Ziv and Lempel two decades ago many dictionary construction schemes have been proposed and implemented This paper considers the following question once a dynamic dictionary construction scheme is selected is there an e cient dynamic parsing method that results with the smallest number of phrases possible for the selected sch...

On Dictionary-Symbolwise Data Compression

Note on the greedy parsing optimality for dictionary-based text compression

Dynamic dictionary-based compression schemes are the most daily used data compression schemes since they appeared in the foundational papers of Ziv and Lempel in 1977, commonly referred to as LZ77. Their work is the base of Deflate, gZip, WinZip, 7Zip and many others compression software. All of those compression schemes use variants of the greedy approach to parse the text into dictionary phra...

Implementation and Experimental Evaluation of Flexible Parsing for Dynamic Dictionary Based Data Compression

We report on the implementation and performance evaluation of greedy parsing with lookaheads for dynamic dictionary compression Speci cally we consider the greedy parsing with a single step lookahead which we call Flexible Parsing FP as an alternative to the commonly used greedy parsing with no lookaheads scheme Greedy parsing is the basis of most popular com pression programs including unix co...