--- title: "Telegraph English — paper by Arbuzov et al. (2026)" description: "The authors propose Telegraph English (TE), an LLM-driven rewrite of a passage into a terse, upper-case dialect. 12 references." authors: ["Mikhail L. Arbuzov", "Sisong Bei", "Ziwei Dong", "Dmitri Kalaev", "Alexey A. Shvets"] year: 2026 venue: "arXiv:2605.04426" source: "https://arxiv.org/abs/2605.04426" doi: "10.48550/arxiv.2605.04426" arxiv: "2605.04426" licence: "CC BY 4.0 (arXiv)" licence_url: "http://creativecommons.org/licenses/by/4.0/" summary_licence: "Elamur Cosmic License" canonical: "https://research.elamur.ai/free/en/papers/arbuzov-2026-telegraph-english-semantic-prompt-compression/" --- [Elamur Research](https://md.research.elamur.ai/free/en/) · [this page in HTML](https://research.elamur.ai/free/en/papers/arbuzov-2026-telegraph-english-semantic-prompt-compression/) [home](https://md.research.elamur.ai/free/en/) / [papers](https://md.research.elamur.ai/free/en/papers/) / [2026](https://md.research.elamur.ai/free/en/papers/2026/page/44/) / Telegraph English: Semantic Prompt Compression via Structured Symbolic Rewriting # Telegraph English: Semantic Prompt Compression via Structured Symbolic Rewriting **Authors:** Mikhail L. Arbuzov, [Sisong Bei](https://md.research.elamur.ai/free/en/authors/sisong-bei/), [Ziwei Dong](https://md.research.elamur.ai/free/en/authors/ziwei-dong/), Dmitri Kalaev and Alexey A. Shvets · **Year:** 2026 · **Venue:** arXiv:2605.04426 · **Licence:** [CC BY 4.0 (arXiv)](http://creativecommons.org/licenses/by/4.0/) **Links:** [Publisher's page](https://arxiv.org/abs/2605.04426) · [PDF](https://arxiv.org/pdf/2605.04426) · [DOI 10.48550/arxiv.2605.04426](https://doi.org/10.48550/arxiv.2605.04426) · [arXiv 2605.04426](https://arxiv.org/abs/2605.04426) · [OpenAlex](https://openalex.org/W7160533177) **Citations:** 0 citations (OpenAlex, 2026-10-14) ## Summary Prompt compression usually works by deleting tokens. LLMLingua-2, for example, trains a classifier to remove low-importance tokens at a fixed ratio. That approach can break coreference and logical links, and it leaves no structure behind. The authors propose Telegraph English (TE), an LLM-driven rewrite of a passage into a terse, upper-case dialect. Each line holds one atomic fact. Relations are written with about 40 fixed symbols, such as causation, implication, contrast and increase. Tags cover time, modality, semantic roles and scope. Because every line is a single fact, the compressed output also works as a set of semantic chunks for retrieval and context management. The authors test TE on 4,081 chunks drawn from LongBench-v2, using a multiple-choice QA protocol across five OpenAI models. TE beats LLMLingua-2 at comparable compression on every model and task. With GPT-4.1 it keeps 99.1% key-fact accuracy, and its lead grows on small models and on fine details. This matters for cheap production pipelines and multi-step agents, where TE text can stay compressed from stage to stage. ## Key points - **Grammar:** Version 5 of the grammar is a 430-line spec that also serves as the compressor's system prompt. Its priorities, in order, are: - fidelity first; - one claim per line; - upper case unless case carries meaning; - about 5× compression only when feasible. At most three symbols may appear in a row. - **Self-checking:** A 12-point quality checklist and a six-pass reasoning order run inside a single call. The passes are: concepts → claims → relations → redundancy → numbers → citations. - **Data and compression:** The authors kept 339 of 503 LongBench-v2 documents, from the Single-Doc QA, Multi-Doc QA and Long-Dialogue categories. They split these into chunks of at most 1,000 words using NLTK, giving 4,081 key-fact and 801 fine-detail QA items. Compression used o4-mini. - The mean ratio was 0.585, a 41.5% reduction, with a range of 0.13–1.57. - Dense short inputs may expand rather than shrink. - LLMLingua-2 was run at retention rates of 0.50 and 0.33. - **Results:** On fine-detail questions with smaller models, such as GPT-4.1-nano and GPT-4o-mini, TE leads by up to 11 points. In a modeled five-step agent pipeline, cost per 1K calls is about $16 for TE, $33 for LLMLingua-2 and $40 uncompressed. - **Limitations:** - English only. - Only OpenAI models, which also generated the QA. - Dynamic context management is not benchmarked. - The only baseline is LLMLingua-2. ## Interesting ideas - Writing exactly one fact per line makes compression and indexing the same step, so each line can be retrieved, updated or pruned on its own without re-running the compressor. - Tags such as AGENT:, PATIENT:, INSTRUMENT:, PAST:/NOW:/FUTURE: and CONF= reduce verbose framing to one marker while staying machine-readable. - The compression ratio is allowed to follow the information density of each input, even expanding dense inputs, instead of being forced to a fixed target. - Key facts are evaluated separately from fine details, where a question can hinge on a single number such as 4.8% versus 4.3%. - Surface forms are fixed at the grammar level, such as VAR=VALUEUNIT, with numbers never abbreviated and always tied to their unit, which removes a whole class of factual errors. ## For Mova How these ideas could serve Mova, our small open language model — its files, stages and tests: - **I1** (back): Our text → graph → text compressor could serialize the meaning graph as one addressable fact per line, so parts of it can be dropped or edited without regenerating the whole text. - **I2** (frames): This suggests a compact, human-auditable linear format for frames, combining VerbNet roles with tense and modality, that is useful for debugging and for feeding frames to LLM teachers. - **I3** (back): We should evaluate our compressor on fidelity first and treat expansion on dense inputs as acceptable, not as a bug. - **I4** (learn): We could build negative-control distractors that change only one number, unit or attribution, to check whether our pipeline really preserves details. - **I5** (world): The measures and values layer could normalize quantities into one canonical form attached to their entity, which would make holdings, maths word problems and comparisons more reliable. *Our summary of the paper, in our own words — not its text. The work belongs to its authors; read it at the links above.* ## Institutions - [Palo Alto Networks](https://md.research.elamur.ai/free/en/companies/palo-alto-networks/) — Company, Santa Clara, United States · 3 works · 2 citations 📚 Shelves (5): [🖥️ Computer Science](https://md.research.elamur.ai/free/en/shelves/computer-science/) · 16,667 works · [🤖 Artificial Intelligence](https://md.research.elamur.ai/free/en/shelves/computer-science/artificial-intelligence/) · 16,194 works · [🎭 Arts and Humanities](https://md.research.elamur.ai/free/en/shelves/arts-and-humanities/) · 16,039 works · [🗣️ Language and Linguistics](https://md.research.elamur.ai/free/en/shelves/arts-and-humanities/language-and-linguistics/) · 15,891 works · [🗄️ Information Systems](https://md.research.elamur.ai/free/en/shelves/computer-science/information-systems/) · 1,437 works 🧭 Topics (1): [English](https://md.research.elamur.ai/free/en/topics/english/) · 2,263 works ## Cite Cite as: Mikhail L. Arbuzov, Sisong Bei, Ziwei Dong, Dmitri Kalaev and Alexey A. Shvets. 2026. Telegraph English: Semantic Prompt Compression via Structured Symbolic Rewriting. arXiv:2605.04426. The paper itself, not this page. BibTeX from the library's record of the work. ```bibtex @misc{arbuzov2026telegraph, title = {{Telegraph English: Semantic Prompt Compression via Structured Symbolic Rewriting}}, author = {Mikhail L. Arbuzov, Sisong Bei, Ziwei Dong, Dmitri Kalaev and Alexey A. Shvets}, year = {2026}, doi = {10.48550/arxiv.2605.04426}, eprint = {2605.04426}, archivePrefix = {arXiv}, url = {https://doi.org/10.48550/arxiv.2605.04426} } ``` - [← previous TeleAI at SemEval-2026 Task 6: A Confidence-Aware Multi-Stage Reasoning Framework with Chain-of-Thought](https://md.research.elamur.ai/free/en/papers/shi-2026-teleai-semeval-2026-task-6/) - [next → TELÓ: AI-Driven Automatic Subtitling for the Promotion of the Performing Arts](https://md.research.elamur.ai/free/en/papers/oliver-2026-telo-ai-driven-automatic-subtitling/) - [↑ back to papers of 2026](https://md.research.elamur.ai/free/en/papers/2026/page/44/) ## References 12 references, 9 of them with a card of ours. ↗ leads to the work, «find» searches for one we have no id for yet. 1. Yushi Bai et al. [Longbench v2: Towards deeper understanding and reasoning on realistic long-context multitasks](https://md.research.elamur.ai/free/en/papers/bai-2024-longbench-v2-deeper-understanding/). arXiv preprint arXiv:2412.15204, 2024. [↗](https://arxiv.org/abs/2412.15204) 2. Alexis Chevalier, Alexander Wettig, Anirudh Ajith, and Danqi Chen. [Adapting language models to compress contexts](https://md.research.elamur.ai/free/en/papers/chevalier-2023-adapting-language-models-compress-contexts/). In Proceedings of EMNLP, 2023. 3. Norbert E. Fuchs, Kaarel Kaljurand, and Tobias Kuhn. Attempto controlled english for knowledge representation. In Reasoning Web, volume 5224 of Lecture Notes in Computer Science, pages 104–124. 2008. [find](https://scholar.google.com/scholar?q=Norbert+E%2E+Fuchs%2C+Kaarel+Kaljurand%2C+and+Tobias+Kuhn%2E+Attempto+controlled+english+for+knowledge+representation%2E+In+Reasoning+Web%2C+volume+5224+of+Lecture+Notes+in+Computer+Science%2C+pages+104%E2%80%93124%2E+2008%2E) 4. Yunfan Gao et al. [Retrieval-augmented generation for large language models: A survey](https://md.research.elamur.ai/free/en/papers/gao-2023-retrieval-augmented-generation-large-language/). arXiv preprint arXiv:2312.10997, 2023. [↗](https://arxiv.org/abs/2312.10997) 5. Yaru Hao et al. Structured prompting: Scaling in-context learning to 1,000 examples. arXiv preprint arXiv:2212.06713, 2023. [↗](https://arxiv.org/abs/2212.06713) 6. Huiqiang Jiang, Qianhui Wu, Chin-Yew Lin, Yuqing Yang, and Lili Qiu. [Llmlingua: Compressing prompts for accelerated inference of large language models](https://md.research.elamur.ai/free/en/papers/jiang-2023-llmlingua-compressing-prompts-accelerated-inference/). In Proceedings of EMNLP, 2023. 7. Patrick Lewis et al. [Retrieval-augmented generation for knowledge-intensive NLP tasks](https://md.research.elamur.ai/free/en/papers/lewis-2020-retrieval-augmented-generation-knowledge-intensive/). In Advances in Neural Information Processing Systems, volume 33, 2020. 8. Charles Packer, Sarah Wooders, Kevin Lin, Vivian Fang, Shishir G. Patil, Ion Stoica, and Joseph E. Gonzalez. Memgpt: Towards llms as operating systems. arXiv preprint arXiv:2310.08560, 2023. [↗](https://arxiv.org/abs/2310.08560) 9. Zhuoshi Pan, Qianhui Wu, Huiqiang Jiang, Menglin Xia, Xufang Luo, Jue Zhang, Qingwei Lin, Victor Ruhle, Yuqing Yang, Chin-Yew Lin, H. Vicky Zhao, Lili Qiu, and Chuanli Wang. [LLMLingua-2: Data distillation for efficient and faithful task-agnostic prompt compression](https://md.research.elamur.ai/free/en/papers/pan-2024-llmlingua-2-data-distillation-efficient/). In Findings of ACL, 2024. [↗](https://doi.org/10.48550/arxiv.2403.12968) 10. Noah Shinn, Federico Cassano, Ashwin Gopinath, Karthik Narasimhan, and Shunyu Yao. [Reflexion: Language agents with verbal reinforcement learning](https://md.research.elamur.ai/free/en/papers/shinn-2023-reflexion-language-agents-verbal-reinforcement/). In Advances in Neural Information Processing Systems, volume 36, 2023. 11. Jason Wei et al. [Chain-of-thought prompting elicits reasoning in large language models](https://md.research.elamur.ai/free/en/papers/wei-2022-chain-thought-prompting-elicits-reasoning/). In Advances in Neural Information Processing Systems, volume 35, 2022. 12. Fangyuan Xu, Weijia Shi, and Eunsol Choi. [RECOMP: Improving retrieval-augmented LMs with compression and selective augmentation](https://md.research.elamur.ai/free/en/papers/xu-2023-recomp-improving-retrieval-augmented-lms/). arXiv preprint arXiv:2310.04408, 2023. [↗](https://arxiv.org/abs/2310.04408) *Updated 1 November 2026*