A fast dynamic compression scheme for natural language texts

DOI10.1016/J.CAMWA.2010.10.019zbMath1207.68134OpenAlexW1965490419MaRDI QIDQ630711

Suneeta Agarwal, Ashutosh Gupta

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

text compressionreal-time transmission

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)

Uses Software

• Canterbury

Cites Work

• Unnamed Item
• Unnamed Item
• Reducing coding redundancy in LZW
• Dynamic huffman coding
• Design and analysis of dynamic Huffman codes
• A universal algorithm for sequential data compression
• Compression of individual sequences via variable-rate coding
• Variations on a theme by Huffman
• String Processing and Information Retrieval
• A Method for the Construction of Minimum-Redundancy Codes

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