Offline Dictionary-based Compression (Re-Pair, Recursive Pairing)
-
Updated
May 29, 2023 - C
Offline Dictionary-based Compression (Re-Pair, Recursive Pairing)
LLMA = LLM Arithmetic coder, which use LLM to do insane text data compression. LLMA=大模型 算术编码,它能使用LLM对文本数据进行暴力的压缩,达到极高的压缩率。
This project is about the implementation of the LZ77 and Deflate COMPRESSION algorithm.
Extreme inline text compression for HTML / JS. A custom pipeline that generates stand-alone HTML or JS files which embed competitively compressed self-extracting text, with file sizes of 25% - 40% the original.
A simple visualization for huffman tree, which is used in encoding text.
🍶 llm-distillery ⇢ use LLMs to run map-reduce summarization tasks on large documents until a target token size is met.
Text compression tool ⚡
Cross platform diff engine for .net core used to compare string values and generate a comparison output
Using Huffman code to encode and compress the secret text data along with using histogram shifting to encode the data into the image.
LZ77 algorithm, providing efficient lossless data compression and decompression capabilities. It offers a reliable and flexible solution for reducing file sizes in various programming languages.
An attempt to compress the enwik8 file
Huffman code
A text compression tool & library
Data driven approach for compressing text using an encoder-decoder architecture and word-level embeddings.
A Java program that implements (4) four lossless text compression techniques for ASCII Text and compares compression ratio.
A simple python implementation for the well-known compression algorithm LZW
PAQ8PX compression archiver
Official Implementation of Paper "A Novel Metric for Evaluating Semantics Preservation"
Add a description, image, and links to the text-compression topic page so that developers can more easily learn about it.
To associate your repository with the text-compression topic, visit your repo's landing page and select "manage topics."