Semantic Chunking and the Entropy of Natural Language

Fuente: arXiv
Enregistré dans:
Détails bibliographiques
Auteurs principaux: Zhong, Weishun, Sivan, Doron, Can, Tankut, Katkov, Mikhail, Tsodyks, Misha
Format: Preprint
Publié: 2026
Sujets:
Accès en ligne:
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
_version_ 1866908839797850112
author Zhong, Weishun
Sivan, Doron
Can, Tankut
Katkov, Mikhail
Tsodyks, Misha
author_facet Zhong, Weishun
Sivan, Doron
Can, Tankut
Katkov, Mikhail
Tsodyks, Misha
contents The entropy rate of printed English is famously estimated to be about one bit per character, a benchmark that modern large language models (LLMs) have only recently approached. This entropy rate implies that English contains nearly 80 percent redundancy relative to the five bits per character expected for random text. We introduce a statistical model that attempts to capture the intricate multi-scale structure of natural language, providing a first-principles account of this redundancy level. Our model describes a procedure of self-similarly segmenting text into semantically coherent chunks down to the single-word level. The semantic structure of the text can then be hierarchically decomposed, allowing for analytical treatment. Numerical experiments with modern LLMs and open datasets suggest that our model quantitatively captures the structure of real texts at different levels of the semantic hierarchy. The entropy rate predicted by our model agrees with the estimated entropy rate of printed English. Moreover, our theory further reveals that the entropy rate of natural language is not fixed but should increase systematically with the semantic complexity of corpora, which are captured by the only free parameter in our model.
format Preprint
id arxiv_https___arxiv_org_abs_2602_13194
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle Semantic Chunking and the Entropy of Natural Language
Zhong, Weishun
Sivan, Doron
Can, Tankut
Katkov, Mikhail
Tsodyks, Misha
Computation and Language
Disordered Systems and Neural Networks
Statistical Mechanics
Artificial Intelligence
The entropy rate of printed English is famously estimated to be about one bit per character, a benchmark that modern large language models (LLMs) have only recently approached. This entropy rate implies that English contains nearly 80 percent redundancy relative to the five bits per character expected for random text. We introduce a statistical model that attempts to capture the intricate multi-scale structure of natural language, providing a first-principles account of this redundancy level. Our model describes a procedure of self-similarly segmenting text into semantically coherent chunks down to the single-word level. The semantic structure of the text can then be hierarchically decomposed, allowing for analytical treatment. Numerical experiments with modern LLMs and open datasets suggest that our model quantitatively captures the structure of real texts at different levels of the semantic hierarchy. The entropy rate predicted by our model agrees with the estimated entropy rate of printed English. Moreover, our theory further reveals that the entropy rate of natural language is not fixed but should increase systematically with the semantic complexity of corpora, which are captured by the only free parameter in our model.
title Semantic Chunking and the Entropy of Natural Language
topic Computation and Language
Disordered Systems and Neural Networks
Statistical Mechanics
Artificial Intelligence
url https://arxiv.org/abs/2602.13194