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 logn) time. We further present some experimental results that show the effectiveness of the dictionary-symbolwise approach.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bell, T.C., Witten, I.H.: The relationship between greedy parsing and symbolwise text compression. J. ACM 41(4), 708–724 (1994)
Cohn, M., Khazan, R.: Parsing with prefix and suffix dictionaries. In: Data Compression Conference, pp. 180–189 (1996)
Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. MIT Press, Cambridge (2001)
Ferragina, P., Nitto, I., Venturini, R.: On the bit-complexity of lempel-ziv compression. In: Proceedings of the Nineteenth Annual ACM -SIAM Symposium on Discrete Algorithms, SODA 2009, pp. 768–777. Society for Industrial and Applied Mathematics, Philadelphia (2009)
Gzip’s Home Page, http://www.gzip.org
Hartman, A., Rodeh, M.: Optimal parsing of strings, pp. 155–167. Springer, Heidelberg (1985)
Horspool, R.N.: The effect of non-greedy parsing in ziv-lempel compression methods. In: Data Compression Conference (1995)
Katajainen, J., Raita, T.: An approximation algorithm for space-optimal encoding of a text. Comput. J. 32(3), 228–237 (1989)
Katajainen, J., Raita, T.: An analysis of the longest match and the greedy heuristics in text encoding. J. ACM 39(2), 281–294 (1992)
Katz, P.: Pkzip archiving tool (1989), http://en.wikipedia.org/wiki/pkzip
Kim, T.Y., Kim, T.: On-line optimal parsing in dictionary-based coding adaptive. Electronic Letters 34(11), 1071–1072 (1998)
Klein, S.T.: Efficient optimal recompression. Comput. J. 40(2/3), 117–126 (1997)
Mahoney, M.: Large text compression benchmark, http://mattmahoney.net/text/text.html
Martelock, C.: Rzm order-1 rolz compressor (April 2008), http://encode.ru/forums/index.php?action=vthread&forum=1&topic=647
Matias, Y., Rajpoot, N., Shainalp, S.C.: The effect of flexible parsing for dynamic dictionary-based data compression. ACM Journal of Experimental Algorithms 6, 10 (2001)
Matias, Y., Shainalp, S.C.: On the optimality of parsing in dynamic dictionary based data compression. In: SODA, pp. 943–944 (1999)
Della Penna, G., Langiu, A., Mignosi, F., Ulisse, A.: Optimal parsing in dictionary-symbolwise data compression schemes (2006), http://www.di.univaq.it/mignosi/ulicompressor.php
Schuegraf, E.J., Heaps, H.S.: A comparison of algorithms for data base compression by use of fragments as language elements. Information Storage and Retrieval 10(9-10), 309–319 (1974)
Storer, J.A., Szymanski, T.G.: Data compression via textural substitution. J. ACM 29(4), 928–951 (1982)
Wagner, R.A.: Common phrases and minimum-space text storage. ACM Commun. 16(3), 148–152 (1973)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
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. https://doi.org/10.1007/978-3-642-19222-7_38
Download citation
DOI: https://doi.org/10.1007/978-3-642-19222-7_38
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-19221-0
Online ISBN: 978-3-642-19222-7
eBook Packages: Computer ScienceComputer Science (R0)