CFP last date
20 December 2024
Call for Paper
January Edition
IJCA solicits high quality original research papers for the upcoming January edition of the journal. The last date of research paper submission is 20 December 2024

Submit your paper
Know more
The week's pick
Responsive image
Improved Shuffled Frog Leaping Algorithm with Self-Adaptive Shuffling for Fuzzy Logic PD+G Controller Optimization in Robotic Manipulators

Duc Hoang Nguyen
Random Articles
Reseach Article

Dynamic with Dictionary Technique for Arabic Text Compression

by Fatima Thaher Ahmad Aburomman
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 135 - Number 9
Year of Publication: 2016
Authors: Fatima Thaher Ahmad Aburomman
10.5120/ijca2016908299

Fatima Thaher Ahmad Aburomman . Dynamic with Dictionary Technique for Arabic Text Compression. International Journal of Computer Applications. 135, 9 ( February 2016), 4-9. DOI=10.5120/ijca2016908299

@article{ 10.5120/ijca2016908299,
author = { Fatima Thaher Ahmad Aburomman },
title = { Dynamic with Dictionary Technique for Arabic Text Compression },
journal = { International Journal of Computer Applications },
issue_date = { February 2016 },
volume = { 135 },
number = { 9 },
month = { February },
year = { 2016 },
issn = { 0975-8887 },
pages = { 4-9 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume135/number9/24075-2016908299/ },
doi = { 10.5120/ijca2016908299 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T23:35:17.943758+05:30
%A Fatima Thaher Ahmad Aburomman
%T Dynamic with Dictionary Technique for Arabic Text Compression
%J International Journal of Computer Applications
%@ 0975-8887
%V 135
%N 9
%P 4-9
%D 2016
%I Foundation of Computer Science (FCS), NY, USA
Abstract

In this research paper we build a new, reliable, and sufficient algorithm for Arabic text language. The proposed algorithm should combine the features of the Huffman and Lempel Ziv algorithms, and is expected be able to reduce the general compression ratio. Our approach is different from Huffman algorithm in the sense that it assigns codes to n-gram symbols where n is a positive integer that is greater than or equal to one. Compared to Huffman algorithm, which assigns a code to each symbol individually, our approach is expected to assign codes to symbols in average. Our approach is different from Lempel Ziv algorithm in the sense that the size of dictionary that we build does not grow in an uncontrolled manner. The size of the dictionary is fixed and its size can be expected prior to process the text files that are to be compressed. This is because the size of each word in the dictionary we build is fixed and is equal to n. So for example, given that the number of different symbols in the text file at hand is m and that n is 2, the total number of entries in the dictionary that we propose to build will be m*m in the worst case.

References
  1. Al-Daoud, A. (2010). "Morphological Analysis and Diacritical Arabic Text Compression." International journal of ACM Jordan (ISSN 2078-7952).
  2. Bently J. L., Sleator D. D., Trajan R. E. and Wel V. K., (1986). "A Locally Adaptive Data Compression Scheme. Communications ACM. 29(4): 320-330.
  3. Blelloch, E., (2002). "Introduction to Data Compression." Computer Science Department, Carnegie Mellon University.
  4. Cheok Yan Cheng, "Introduction On Text Compression Using Lempel, Ziv, Welch (LZW) method".
  5. Coremen, Thomas H., Charles E. Leiserson, Ronald L. Rivest. (2002). "Introduction to Algorithms." Second Edition.
  6. Elabdalla, A. R. and Irshid, M. I.,(2001). "An efficient bitwise Huffman coding technique based on source mapping." Computer and electrical engineering 27(1): 265 – 272.
  7. Ghawanmeh, S.; Al-Shalabi, R. and Kanaan, G., (2006). "Efficient Data Compression Sheme using Dynamic Huffman Code Applied on Arabic Language." J. Comput. Sci. 2(1): 885-888. http://www.scipub.org/fulltext/jcs212885-888.pdf
  8. Hjouj Btoush M, siddiqi, M., J.; Akhgar, B. and Dawawdeh, Z. (2008) "Observation on Compressing Text Files of Varying Length". Proceedings of ITNG.
  9. Ida Mengyi Pu. (2006). "Fundamental_Data_Compression".
  10. Jaradat, A. M.; Irshid, M.I. and Nassar, T. T., (2006). "Entropy Reduction of Arabic Text Files."Asian J.Inform.Technol.5(1):578583. http://medwelljournals.com/fillext/ajit/2006/578-583.pdf
  11. Musa, A.; Al-Damour, A., Fraij, F.; Al-Khaleel, O. And Irshid, M. (2010). "A Dynamic and Secure Arabic Text Compression Technique Using Bitwise Lempel-Zive Algorithm." Information technology journal 9(4):673-679.
  12. Omer, I. and Khatatneh, K. (2010). "Arabic Short Text Compression." J. Comput. Sci. 6(1): 24-28.
  13. Arabic-Language, Arabic language history (2011), Retrieved March 22, 2011 from http://www.arabic-language.org/arabic/history.asp
  14. Arturo San Emeterio Campos, Huffman Algorithm, making codes from probability, Retrieved March 22, 2011 from http:// www.arturocampos.com/cp_ch3-1.html
  15. Matt Powell, University of Canterbury, Retrieved March 22, 2011 from http://corpus.canterbury.ac.nz
  16. Wordiq, Huffman Algorithm – Definition (2010), Retrieved March 20, 2011 from http://wordiq.com/definition/Huffman_coding.
Index Terms

Computer Science
Information Sciences

Keywords

Data compression Text compression Arabic Text File data compression.

Powered by PhDFocusTM