A bit-level text compression scheme based on the ACW algorithm

2010 ◽  
Vol 7 (1) ◽  
pp. 123-131 ◽  
Author(s):  
Hussein Al-Bahadili ◽  
Shakir M. Hussain
Keyword(s):  
Text Compression ◽  
Compression Scheme

scholarly journals Better Adaptive Text Compression Scheme

2018 ◽  
Vol 27 (2) ◽  
pp. 48-57
Author(s):  
Duha Amir Sultan
Keyword(s):  
Text Compression ◽  
Compression Scheme

scholarly journals Automatic Correction of Arabic Dyslexic Text

Computers ◽  
2019 ◽  
Vol 8 (1) ◽  
pp. 19 ◽  
Author(s):  
Maha Alamri ◽  
William Teahan
Keyword(s):  
Word Processing ◽  
Language Model ◽  
Text Compression ◽  
Arabic Text ◽  
Automatic Correction ◽  
Compression Scheme ◽  
Candidate List ◽  
Arabic Word ◽  
Processing Software ◽  
Correction System

This paper proposes an automatic correction system that detects and corrects dyslexic errors in Arabic text. The system uses a language model based on the Prediction by Partial Matching (PPM) text compression scheme that generates possible alternatives for each misspelled word. Furthermore, the generated candidate list is based on edit operations (insertion, deletion, substitution and transposition), and the correct alternative for each misspelled word is chosen on the basis of the compression codelength of the trigram. The system is compared with widely-used Arabic word processing software and the Farasa tool. The system provided good results compared with the other tools, with a recall of 43%, precision 89%, F1 58% and accuracy 81%.

An Enhanced Short Text Compression Scheme for Smart Devices

2010 ◽  
Vol 5 (1) ◽  
Author(s):  
Md. Rafiqul Islam ◽  
S. A. Ahsan Rajon
Keyword(s):  
Smart Devices ◽  
Text Compression ◽  
Compression Scheme ◽  
Short Text

scholarly journals Intensification of Lempel-ZIV-Welch Algorithm

2019 ◽  
Vol 8 (9S) ◽  
pp. 587-591
Keyword(s):  
Data Compression ◽  
Compression Ratio ◽  
Text Compression ◽  
Code Length ◽  
File Size ◽  
Compression Scheme ◽  
Compression Algorithms ◽  
Original Algorithm ◽  
Using Data

There is a necessity to reduce the consumption of exclusive resources. This is achieved using data compression. The data compression is one well known technique which can reduce the file size. A plethora of data compression algorithms are available which provides compression in various ratios. LZW is one of the powerful widely used algorithms. This paper attempts to propose and apply some enhancements to LZW, hence comes out with an efficient lossless text compression scheme that can compress a given file at better compression ratio. The paper proposes three approaches which practically enhances the original algorithm. These approaches try to gain better compression ratio. In approach1, it exploits the notion of using existing string code with odd code for a newly encounter string which is reverse of existing. In approach2 it uses a choice of code length for the current compression, so avoiding the problem of dictionary overflow. In approach3 it appends some selective set of frequently encountered string patterns. So the intensified LZW method provides better compression ratio with the inclusion of the above features.

Text compression using FI sequences

1993 ◽  
Author(s):  
Cleopas Angaye ◽  
Paul Fisher
Keyword(s):  
Text Compression
Sign in / Sign up

Export Citation Format

Share Document