Table of Content

Open Access iconOpen Access



Text Compression Based on Letter’s Prefix in the Word

Majed AbuSafiya1, *

1 Al-Ahliyya Amman University, Amman, 19328, Jordan.

* Corresponding Author: Majed AbuSafiya. Email: email.

Computers, Materials & Continua 2020, 64(1), 17-30.


Huffman [Huffman (1952)] encoding is one of the most known compression algorithms. In its basic use, only one encoding is given for the same letter in text to compress. In this paper, a text compression algorithm that is based on Huffman encoding is proposed. Huffman encoding is used to give different encodings for the same letter depending on the prefix preceding it in the word. A deterministic finite automaton (DFA) that recognizes the words of the text is constructed. This DFA records the frequencies for letters that label the transitions. Every state will correspond to one of the prefixes of the words of the text. For every state, a different Huffman encoding is defined for the letters that label the transitions leaving that state. These Huffman encodings are then used to encode the letters of the words in the text. This algorithm was implemented and experimental study showed significant reduction in compression ratio over the basic Huffman encoding. However, more time is needed to construct these codes.


Cite This Article

APA Style
AbuSafiya, M. (2020). Text compression based on letter’s prefix in the word. Computers, Materials & Continua, 64(1), 17-30.
Vancouver Style
AbuSafiya M. Text compression based on letter’s prefix in the word. Comput Mater Contin. 2020;64(1):17-30
IEEE Style
M. AbuSafiya, "Text Compression Based on Letter’s Prefix in the Word," Comput. Mater. Contin., vol. 64, no. 1, pp. 17-30. 2020.

cc This work is licensed under a Creative Commons Attribution 4.0 International License , which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
  • 2756


  • 1405


  • 0


Share Link