Text Compression Based on Letter’s Prefix in the Word  

作　　者：Majed AbuSafiya 

机构地区：[1]Al-Ahliyya Amman University,Amman,19328,Jordan

出　　处：《Computers, Materials & Continua》2020年第7期17-30,共14页计算机、材料和连续体（英文）

摘　　要：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.

关 键 词：Text compression Huffman encoding deterministic finite automata 

分 类 号：TP3[自动化与计算机技术—计算机科学与技术]