By Topic

Dictionary-based English text compression using word endings

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Jeehong Yang ; Dept. of Electr. Eng. & Comput. Sci., Michigan Univ., Ann Arbor, MI ; Savari, S.A.

In this paper, we propose an dictionary-based English text compression algorithm; we name it star word ending (StarWE) because of certain similarities to the StarNT algorithm. Furthermore, StarWE borrows techniques that are used in WRT such as EOL coding, punctuation mark modeling, and n-gram matching. The main difference between StarWE and StarNT is in the division of the external dictionary; StarWE divides it by word endings so that the compressor would be able to obtain some of the tag information

Published in:

Data Compression Conference, 2007. DCC '07

Date of Conference:

27-29 March 2007