Reducing Text Fat with Lempel-ziv-welch Algorithm

Abstract

But dictionary-based compression algorithms use a completely different method to
compress data as compared to statistical compression methods. This family of algorithms does not
encode single symbols as variable length bit strings; it encodes variable-length strings of symbols as
single tokens. The tokens form an index to a phrase dictionary. If the tokens are smaller than the
phrases they replace, compression occurs. This paper describes a dictionary based compression
algorithm called Lempel-ziv-welch Algorithm. The algorithm is suitable for lossless text compression.