Evaluation of Persian Text Based on Huffman Data Compression

被引:0
|
作者
Jalilian, Omid [1 ]
Haghighat, Abolfazl Toroghi [2 ]
Rezvanian, Alireza [1 ]
机构
[1] Islamic Azad Univ, Hamedan Branch, Tehran, Iran
[2] Islamic Azad Univ, Qazvin Branch, Tehran, Iran
关键词
component; Data mining; Persian language; Persian web; Text compression; Huffman data compression; Persian texts compression;
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
According to the growth of information sources in recent years along the web, many of web servers have been dedicated to the information sources storage. Until yet many methods are presented for storing and transforming information on the web in the case of paralleling or processing. But one of the researcher's challenges in derivation and restoring data in data mining and information retrievals are to face to this huge amount of information for storing. One of the solutions of this problem is compression of information resources. Notice that the published statistics, Persian language is one of the oldest and the most diffused languages all around the world and web and also according to its kind of alphabets and variety along the Persian texts, an evaluation on compression for Persian texts will be useful. First of all in this paper variety difficulties and huge amount of information on the web, general aspects of Huffman compression methods are introduced, and also some features of Persian language. The state of choosing Persian texts collections has been investigated and the result of tests in compare with some experimental datasets form Persian, English and Arabic were shown. The experimental results are given at the end of paper.
引用
收藏
页码:180 / +
页数:2
相关论文
共 50 条
  • [21] An efficient secure data compression technique based on chaos and adaptive Huffman coding
    Usama, Muhammad
    Malluhi, Qutaibah M.
    Zakaria, Nordin
    Razzak, Imran
    Iqbal, Waheed
    PEER-TO-PEER NETWORKING AND APPLICATIONS, 2021, 14 (05) : 2651 - 2664
  • [22] Robust Data Compression Algorithm utilizing LZW Framework based on Huffman Technique
    Shrividhiya, G.
    Srujana, K. S.
    Kashyap, Sukruta N.
    Gururaj, C.
    2021 INTERNATIONAL CONFERENCE ON EMERGING SMART COMPUTING AND INFORMATICS (ESCI), 2021, : 234 - 237
  • [23] HUFFMAN COMPRESSION
    ZIGLER, R
    DR DOBBS JOURNAL, 1994, 19 (02): : 10 - 10
  • [24] A DATA-COMPRESSION SCHEME FOR CHINESE TEXT FILES USING HUFFMAN CODING AND A 2-LEVEL DICTIONARY
    ONG, GH
    HUANG, SY
    INFORMATION SCIENCES, 1995, 84 (1-2) : 85 - 99
  • [25] Data compression through adaptive Huffman coding scheme
    Javed, MY
    Nadeem, A
    IEEE 2000 TENCON PROCEEDINGS, VOLS I-III: INTELLIGENT SYSTEMS AND TECHNOLOGIES FOR THE NEW MILLENNIUM, 2000, : A187 - A190
  • [26] Application of Huffman Data Compression Algorithm in Hashing Computation
    Venkata, Lakshmi Narasimha Devulapalli
    Atici, Mustafa
    ACMSE '18: PROCEEDINGS OF THE ACMSE 2018 CONFERENCE, 2018,
  • [27] Blowfish algorithm and Huffman compression for data security application
    Triana, Yaya Sudarya
    Retnowardhani, Astari
    INTERNATIONAL CONFERENCE ON DESIGN, ENGINEERING AND COMPUTER SCIENCES, 2018, 453
  • [28] Dynamic Alternation of Huffman Codebooks for Sensor Data Compression
    Yunge, Daniel
    Park, Sangyoung
    Kindt, Philipp
    Chakraborty, Samarjit
    IEEE EMBEDDED SYSTEMS LETTERS, 2017, 9 (03) : 81 - 84
  • [29] Hybrid DCT/Quantized Huffman Compression for Flectroencephalography Data
    Elaskary, Ramez Moh.
    Saeed, Mohamed
    Ismail, Tawfik
    Mostafa, Hassan
    Gabran, Salam
    2017 PROCEEDINGS OF THE JAPAN-AFRICA CONFERENCE ON ELECTRONICS, COMMUNICATIONS, AND COMPUTERS (JAC-ECC), 2017, : 111 - 114
  • [30] Double compression of test data using Huffman code
    Aarthi, R. S. (aarthirs@ymail.com), 1600, Asian Research Publishing Network (ARPN) (39):