Dictionary-symbolwise flexible parsing

Authors:
Maxime Crochemore;Laura Giambruno;Alessio Langiu;Filippo Mignosi;Antonio Restivo
Affiliations:
Dept. of Computer Science, King's College London, London, UK and Institut Gaspard-Monge, Université Paris-Est, France;Dipartimento di Matematica e Informatica, Università di Palermo, Palermo, Italy;Dipartimento di Matematica e Informatica, Università di Palermo, Palermo, Italy and Institut Gaspard-Monge, Université Paris-Est, France;Dipartimento di Informatica, Università dell'Aquila, L'Aquila, Italy;Dipartimento di Matematica e Informatica, Università di Palermo, Palermo, Italy
Venue:
IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms
Year:
2010

Citing 11
Cited 2

An approximation algorithm for space-optimal encoding of a text

The Computer Journal
An analysis of the longest match and the greedy heuristics in text encoding

Journal of the ACM (JACM)
The relationship between greedy parsing and symbolwise text compression

Journal of the ACM (JACM)
On the optimality of parsing in dynamic dictionary based data compression

Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Data compression via textual substitution

Journal of the ACM (JACM)
Common phrases and minimum-space text storage

Communications of the ACM
Introduction to Algorithms

Introduction to Algorithms
Parsing with suffix and prefix dictionaries

DCC '96 Proceedings of the Conference on Data Compression
The effect of non-greedy parsing in Ziv-Lempel compression methods

DCC '95 Proceedings of the Conference on Data Compression
The Effect of Flexible Parsing for Dynamic Dictionary-Based Data Compression

Journal of Experimental Algorithmics (JEA)
On the bit-complexity of Lempel-Ziv compression

SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms

Dictionary-symbolwise flexible parsing

Journal of Discrete Algorithms
On parsing optimality for dictionary-based text compression-the Zip case

Journal of Discrete Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 dictionaries and any symbolwise compressor under some natural hypothesis. In the case of LZ78-alike algorithms with variable costs and any, linear as usual, symbolwise compressor can be implemented in linear time. In the case of LZ77-alike dictionaries and any symbolwise compressor it can be implemented in O(n log(n)) time. We further present some experimental results that show the effectiveness of the dictionary-symbolwise approach.