Issue No. 05 - May (2005 vol. 54)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TC.2005.85
J? Abel , IEEE
William Teahan , IEEE
Several preprocessing algorithms for text files are presented which complement each other and which are performed prior to the compression scheme. The algorithms need no external dictionary and are language independent. The compression gain is compared along with the costs of speed for the BWT, PPM, and LZ compression schemes. The average overall compression gain is in the range of 3 to 5 percent for the text files of the Calgary Corpus and between 2 to 9 percent for the text files of the large Canterbury Corpus.
Algorithms, data compression, BWT, LZ, PPM, preprocessing, text compression.
J? Abel, William Teahan, "Universal Text Preprocessing for Data Compression", IEEE Transactions on Computers, vol. 54, no. , pp. 497-507, May 2005, doi:10.1109/TC.2005.85