mlsanityData to 7 Oct 2026

Telegraph English: Semantic Prompt Compression via Structured Symbolic Rewriting

arXiv 2605.04426 ↗First posted 6 May 2026cs.CLcited by 2

On the map: Efficient LLM inference and serving → Prompt and context compression

Abstract (arXiv)

We introduce Telegraph English (TE), a prompt-compression protocol that rewrites natural language into a symbol-rich, formally-structured dialect. Where token-deletion methods such as LLMLingua-2 train a classifier to delete low-importance tokens at a fixed ratio, TE performs a full semantic rewrite: it decomposes the input into atomic fact lines, substitutes verbose phrases with ~40 logical and relational symbols, and lets the compression ratio adapt to each document's information density. A consequence of the line-structure rule is that compression and semantic chunking become the same operation -- each output line is an independently addressable fact, so the compressed representation is simultaneously a semantic index. We evaluate TE on 4,081 question-answer pairs from LongBench-v2 across five OpenAI models and two difficulty levels. At roughly 50% token reduction, TE preserves 99.1% accuracy on key facts with GPT-4.1 and outperforms LLMLingua-2 at matched compression ratios on every model and task tested. The gap widens on smaller models -- up to 11 percentage points on fine-detail tasks -- suggesting that explicit relational structure compensates for limited model capacity. We release the grammar specification, compression prompt, benchmark data, and reference implementation.

Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Placed in Prompt and context compression, one of 12 directions in Efficient LLM inference and serving. Builds on 10 of its 11 references that are in the map. First posted on arXiv 6 May 2026.

Builds on

10 of 11 references.

Closest ancestors · 1

Same direction, newest first

  1. 2024LLMLingua-2: Data Distillation for Efficient and Faithful Task-Agnostic Prompt Compression19 Mar

Other references · 9

  1. 2022Chain-of-Thought Prompting Elicits Reasoning in Large Language Modelscited by 12,302
  2. 2020Retrieval-Augmented Generation for Knowledge-Intensive NLP Taskscited by 9,160
  3. 2023Reflexion: Language Agents with Verbal Reinforcement Learningcited by 4,064
  4. 2023Retrieval-Augmented Generation for Large Language Models: A Surveycited by 2,185
  5. 2023MemGPT: Towards LLMs as Operating Systemscited by 1,295
  6. 2024LongBench v2: Towards Deeper Understanding and Reasoning on Realistic Long-context Multitaskscited by 367
  7. 2023Adapting Language Models to Compress Contextscited by 350
  8. 2023LLMLingua: Compressing Prompts for Accelerated Inference of Large Language Modelscited by 279
  9. 2022Structured Prompting: Scaling In-Context Learning to 1,000 Examplescited by 81

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 2.

2 papers.

Similar, not cited

Close in wording, no citation either way

  1. 2026Context Compression Is Not One Thing: Readable Symbolic Re-expression vs. Coherent Summary at Matched Budget
  2. 2026SemanticFold: Latent Sequence Compression SeparatesLanguage Modeling, Decodability, and Reasoning
  3. 2026Lexical Prompt Compression for Large Language Models: A Training-Free, Deterministic Pipeline with Empirical Pareto Analysis Across Eleven Task Categories
  4. 2026Lost in Compression: A Controlled Cross-Lingual Audit of Extractive Prompt Compressors
  5. 2025Understanding and Improving Information Preservation in Prompt Compression for LLMs
  6. 2024Prompt Compression with Context-Aware Sentence Encoding for Fast and Improved LLM Inference
  7. 2024Fundamental Limits of Prompt Compression: A Rate-Distortion Framework for Black-Box Language Models
  8. 2025Cmprsr: Abstractive Token-Level Question-Agnostic Prompt Compressor