Research indexJournal article
Universal Text Preprocessing for Data Compression
Abel, Teahan
IEEE Transactions on Computers21 Mar 2005
Universal Text Preprocessing for Data Compression
Abel, Teahan · IEEE Transactions on Computers · 2005 · Subscription
The full text is at the publisher
You can read the abstract here, or open it at the publisher.
Abstract
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.