Every Time I Hire a Linguist, Inference Costs Go Down: On Linguistic Rules as Effective Prompt Compressors
Summary
This paper proposes using linguistic rules alone as prompt compressors without LM forward passes, achieving performance similar to advanced strategies under light-to-moderate compression.
View Cached Full Text
Cached at: 07/29/26, 09:55 AM
# Every Time I Hire a Linguist, Inference Costs Go Down: On Linguistic Rules as Effective Prompt Compressors
Source: [https://arxiv.org/abs/2607.25335](https://arxiv.org/abs/2607.25335)
[View PDF](https://arxiv.org/pdf/2607.25335)
> Abstract:Prompt compression shortens LLM input to reduce inference cost, yet existing methods score token importance through LM forward passes\. It remains questionable whether such nuanced, costly token selection is necessary\. Compression requires identifying informative content, a problem that linguistic research has long addressed through cues that can be operationalized as deterministic rules\. We therefore ask: can \\textbf\{linguistic rules alone\} serve as effective prompt compressors, without LM\-based scoring at compression time? To address this, we conduct offline evolutionary search over lexical, syntactic, semantic, and discourse seeds to find competitive rule combinations\. The resulting linguistic compressor requires no LM forward pass at deployment and uses only CPU\-side processing for compression\. We evaluate it with a dual\-path protocol to balance compression quality and reconstruction fidelity\. Across short passages, multi\-document reasoning, and dialogue\-memory QA datasets, evolved compressors achieve performance similar to that of recent advanced prompt\-compression strategies\. Performance is strongest under light\-to\-moderate compression and degrades as compression becomes more aggressive, while the Direct and Reconstruction paths exhibit distinct patterns\. Evolutionary analysis reveals that effective compression fuses signals across linguistic levels and, as the compression ratio increases, rules shift from token pruning to sentence extraction\.
## Submission history
From: Zhaoxin Feng \[[view email](https://arxiv.org/show-email/7be03a68/2607.25335)\] **\[v1\]**Tue, 28 Jul 2026 06:33:27 UTC \(735 KB\)Similar Articles
AGORA: Adapter-Grounded Observation-Action Retention for Inference-Free Prompt Compression in LLM Agents
AGORA introduces an inference-free step-level prompt compressor for LLM agents that avoids the 'action-grammar destruction' failure mode of token-level compressors. It retains ≥75% uncompressed performance in 8 of 9 environments across backbones, using a structural parser, an always-keep floor, and a learned relevance scorer.
Diffuse to Compress: Leveraging Diffusion LMs for Lossless Compression
This paper introduces Diffusion Language Models (DLMs) as a new inference paradigm for lossless text compression, aiming to overcome the throughput bottlenecks of autoregressive LLM-based compressors while achieving state-of-the-art compression ratios.
CAVEWOMAN: How Large Language Models Behave Under Linguistic Input and Output Compression
This paper introduces CAVEWOMAN, a two-channel evaluation protocol for assessing the effects of linguistic input and output compression on LLMs. It finds that output compression reduces costs, while input compression increases costs and degrades accuracy, challenging the common 'caveman style' advice.
Prompt Compression via Activation Aggregation
This paper proposes compressing instruction prompts into a single activation vector via learned weighted sums of intermediate layer activations, achieving under 2% accuracy drop and revealing insights into LLM activation space structure.
Reducing LLM Latency
Techniques and methods for reducing latency in large language models, improving inference speed.