A fast dynamic compression scheme for natural language texts

Authors:
Ashutosh Gupta;Suneeta Agarwal
Affiliations:
Department of Computer Science & Information Technology, Institute of Engineering & Technology, MJP Rohilkhand University, Bareilly, Uttar Pradesh, India;Department of Computer Science & Engineering, Motilal Nehru National Institute of Technology (Deemed University), Allahabad-211002, Uttar Pradesh, India
Venue:
Computers & Mathematics with Applications
Year:
2010

Citing 20
Cited 0

Dynamic Huffman coding

Journal of Algorithms
Design and analysis of dynamic Huffman codes

Journal of the ACM (JACM)
Word-based text compression

Software—Practice & Experience
Text compression

Text compression
Arithmetic coding for data compression

Communications of the ACM
Arithmetic coding revisited

ACM Transactions on Information Systems (TOIS)
Fast and flexible word searching on compressed text

ACM Transactions on Information Systems (TOIS)
Compression and Coding Algorithms

Compression and Coding Algorithms
A Dictionary-Based Compressed Pattern Matching Algorithm

COMPSAC '02 Proceedings of the 26th International Computer Software and Applications Conference on Prolonging Software Life: Development and Redevelopment
A Text Compression Scheme That Allows Fast Searching Directly in the Compressed File

CPM '94 Proceedings of the 5th Annual Symposium on Combinatorial Pattern Matching
Fast Searching over Compressed Text using A New Coding Technique: Tagged Sub-optimal Code (TSC)

DCC '04 Proceedings of the Conference on Data Compression
Pattern Matching in LZW Compressed Files

IEEE Transactions on Computers
Efficiently decodable and searchable natural language adaptive compression

Proceedings of the 28th annual international ACM SIGIR conference on Research and development in information retrieval
Transform based and search aware text compression schemes and compressed domain text retrieval

Transform based and search aware text compression schemes and compressed domain text retrieval
A Technique for High-Performance Data Compression

Computer
Reducing coding redundancy in LZW

Information Sciences: an International Journal
Compressing dynamic text collections via phrase-based coding

ECDL'05 Proceedings of the 9th European conference on Research and Advanced Technology for Digital Libraries
A universal algorithm for sequential data compression

IEEE Transactions on Information Theory
Compression of individual sequences via variable-rate coding

IEEE Transactions on Information Theory
Variations on a theme by Huffman

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.09

Visualization

Abstract

We adapted Word-based Tagged Code (WBTC) to obtain its dynamic version. The aim of designing a dynamic version of WBTC is to adapt it for real-time transmission. The problem in the semi-static technique is to perform two passes over the source text, and therefore encoding cannot start before the whole first pass has been completed. For this reason, the semi-static technique is not applied to compress text streams. However, the adaptive or dynamic model does not have this limitation. The dynamic WBTC can be used for real-time transmission where the semi-static version is not suited at all. The experimental results show that the Dynamic WBTC is suitable for compressing text streams by utilizing low bandwidth.