A fast dynamic compression scheme for natural language texts

DOI10.1016/J.CAMWA.2010.10.019MaRDI QIDQ630711zbMATH OpenOpenAlexFDO

Authors Ashutosh Gupta, Suneeta Agarwal

Publication date 19 March 2011

Published in Computers & Mathematics with Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.camwa.2010.10.019

zbMATH Keywords

real-time transmissiontext compression

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Natural language processing (68T50)

Recommendations

• String Processing and Information Retrieval
• Improving semistatic compression via pair-based coding
• New word-based adaptive dense compressors
• \((s,c)\)-dense coding: an optimized compression code for natural language text databases.
• Text and hypertext compression

Cites work

• A Method for the Construction of Minimum-Redundancy Codes
• A universal algorithm for sequential data compression
• Compression of individual sequences via variable-rate coding
• Design and analysis of dynamic Huffman codes
• Dynamic huffman coding
• scientific article; zbMATH DE number 1629861 (Why is no real title available?)
• scientific article; zbMATH DE number 3476581 (Why is no real title available?)
• Reducing coding redundancy in LZW
• String Processing and Information Retrieval
• Variations on a theme by Huffman

Cited in

(3)

• Transforming the Natural Language Text for Improving Compression Performance
• String Processing and Information Retrieval
• The use of genetic programming for adaptive text compression

Describes a project that uses

Uses Software

• Canterbury

This page was built for publication: A fast dynamic compression scheme for natural language texts

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q630711)