Dictionary-Symbolwise Flexible Parsing
- Cite this paper as:
- Crochemore M., Giambruno L., Langiu A., Mignosi F., Restivo A. (2011) Dictionary-Symbolwise Flexible Parsing. In: Iliopoulos C.S., Smyth W.F. (eds) Combinatorial Algorithms. IWOCA 2010. Lecture Notes in Computer Science, vol 6460. Springer, Berlin, Heidelberg
Linear time optimal parsing algorithms are very rare in the dictionary based branch of the data compression theory. The most recent is the FlexibleParsing 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 − SymbolwiseFlexibleParsing 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 logn) time. We further present some experimental results that show the effectiveness of the dictionary-symbolwise approach.
Unable to display preview. Download preview PDF.