Browse State-of-the-Art › Text Compression
Text Compression
18 papers with code · 0 benchmarks · 0 datasets archive 2025-07-28
Benchmarks archive 2025-07-28
No benchmark for this task in the archive.
Libraries
Not in the archive: the export carries no per-task library table, so there is nothing to show at snapshot 2025-07-28.
Datasets archive 2025-07-28
No dataset record in the archive lists this task.
Subtasks archive 2025-07-28
No subtask under this task in the archive's task tree.
Most implemented papers archive 2025-07-28
18 shown of 18 papers with code (43 tagged with this task in all), ordered by repositories listed in the archive, not by stars (the archive holds no stars, so PwC's “Social” and “Latest” sorts cannot be reproduced). Papers without a page here are shown as plain text.
-
31 Oct 2023 2 repositories listed Syntology ran 2 of 3 samples · 1 unverified · 3 pointer-only (licence)Surprisingly, our findings indicate that neural retrieval models tend to rank LLM-generated documents higher.
-
6 Jun 2023 2 repositories listedWe provide new estimates of an asymptotic upper bound on the entropy of English using the large language model LLaMA-7B as a predictor for the next token given a window of past tokens.
-
4 Jun 2025 1 repository listedThe mismatch in vocabulary also hinders deep knowledge transfer between LLMs like token-level distillation.
-
10 Feb 2025 1 repository listedAutomatically summarizing large text collections is a valuable tool for document research, with applications in journalism, academic research, legal work, and many other fields.
-
21 Dec 2024 1 repository listedLearning-based probabilistic models can be combined with an entropy coder for data compression.
-
10 Dec 2024 1 repository listedWe introduce IntellectSeeker, an innovative and personalized intelligent academic literature management platform to address these challenges.
-
25 Sep 2024 1 repository listedWe compare traditional text compression systems with neural network and LLM-based text compression methods.
-
23 Sep 2024 1 repository listedData compression continues to evolve, with traditional information theory methods being widely used for compressing text, images, and videos.
-
6 Sep 2024 1 repository listedLanguage models can largely benefit from efficient tokenization.
-
12 Aug 2024 1 repository listedXCompress offers manual, brute force, and Large Language Model (LLM) methods to determine the most suitable algorithm based on the type of text data.
-
10 Jun 2024 1 repository listed Syntology ran 3 of 3 samples · 0 unverifiedTo extend the context length of Transformer-based large language models (LLMs) and improve comprehension capabilities, we often face limitations due to computational resources and bounded memory storage capacity.
-
19 Mar 2024 1 repository listedAdditionally, our model is 3x-6x faster than existing prompt compression methods, while accelerating the end-to-end latency by 1.
-
27 Jul 2023 1 repository listedThe effectiveness of compression in text classification ('gzip') has recently garnered lots of attention.
-
4 Oct 2021 1 repository listedOverlapping frequently occurs in paired texts in natural language processing tasks like text editing and semantic similarity evaluation.
-
1 Jun 2019 1 repository listedNeural sequence-to-sequence models have been successfully applied to text compression.
-
20 Aug 2017 1 repository listedTraining large vocabulary Neural Network Language Models (NNLMs) is a difficult task due to the explicit requirement of the output layer normalization, which typically involves the evaluation of the full softmax…
-
1 Jun 2017 1 repository listedInstead, the only three key components of our method are a compressing algorithm, a dissimilarity measure and a threshold, needed to accept or reject the authorship of the questioned document.
-
8 Aug 2016 1 repository listedWe present a self-contained system for constructing natural language models for use in text compression.
Syntology lines on 2 of the papers shown; no Syntology record for the others (a paper without an arXiv id cannot be joined to the graph, and absence from the graph layer is not a recorded non-run). “Ran” means the sample executed on a synthesized fixture, not that the paper's result was reproduced. Read from the graph 2026-09-24.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections