Optimal Parsing for Dictionary-Based Compression

Dictionary-based compression algorithms include a parsing strategy to factorise the input text into a sequence of dictionary phrases. Given a text, such process usually is not unique and, for compression purpose, it makes sense to find one of the possible parsing that minimise the output size. This is the parsing problem. In more than 30 years of history of dictionary-based text compression only few optimal parsing algorithms were presented. Most of the practical dictionary-based compression solutions need or prefer to factorise the input data into a sequence of dictionary-phrases and symbols. Those two output categories are encoded via two different encoders. This book contains a review of many dictionary-based compression schemes, their theoretical basis, a focus on the parsing problem and related problems, a recent theoretical model for such compression schemes, and an optimal solution called Dictionary-Symbolwise Flexible Parsing that covers almost all the classic dictionary-based compression schemes and the more general Dictionary-Symbolwise variant, where letters and dictionary references are compressed via different variable-length encoders.

Autorentext

Dr Alessio Langiu obtained a joint Ph.D. in Informatics from University of Palermo, Italy, and Paris-Est University, France, in 2012. He is a Research Fellow of the Informatics Department at King's College London in UK. His research focuses on stringology, text indexing, data compression and bioinformatics.