Please use this identifier to cite or link to this item:
|Title:||Dictionary selection using partial matching|
|Citation:||Hoang, D.T., Long, P.M., Vitter, J.S. (1999). Dictionary selection using partial matching. Information sciences 119 (1-2) : 57-72. ScholarBank@NUS Repository. https://doi.org/10.1016/S0020-0255(99)00060-2|
|Abstract:||This work concerns the search for text compressors that compress better than existing dictionary coders, but run faster than statistical coders. We describe a new method for text compression using multiple dictionaries, one for each context of preceding characters, where the contexts have varying lengths. The context to be used is determined using an escape mechanism similar to that of prediction by partial matching (PPM) methods. We describe modifications of three popular dictionary coders along these lines and experiments evaluating their effectiveness using the text files in the Calgary corpus. Our results suggest that modifying LZ77, LZFG, and LZW along these lines yields improvements in compression of about 3%, 6%, and 15%, respectively.|
|Source Title:||Information sciences|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Nov 14, 2018
WEB OF SCIENCETM
checked on Nov 6, 2018
checked on Oct 13, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.