Entropy Rate Constancy in Text
Paper · 2002 · Dmitriy Genzel and Eugene Charniak
Summary
Genzel and Charniak ask whether people writing text keep the amount of information per word roughly steady. Information theory says a constant rate is the most efficient way to use a noisy channel. They split a word's conditioning history into two parts: the words earlier in the same sentence, and all preceding sentences. If total conditional entropy stays flat, then entropy measured without the earlier sentences should grow as a text goes on, because those sentences carry more and more useful information.
They test this corollary on Wall Street Journal text using three estimators:
- an n-gram model,
- the Charniak (2001) statistical parser used as a language model,
- the non-parametric estimator of Kontoyiannis et al. (1998).
All three show context-free sentence entropy rising with sentence position.
A part-of-speech breakdown, combined with a cache model, shows two causes of the rise. One is lexical (which words recur) and the other is non-lexical (how words are used). The work gives an indirect, measurable signature of discourse context. It suggests language modeling as a tool for studying how context shapes text.
Key points
- The n-gram and parser experiments train on Penn Treebank sections 0–20 and test on sections 21–24. Each article is a separate text, and scores are averaged by sentence number. The parser gives lower (better) entropy estimates than the n-gram model, but both rise in the same way.
- The non-parametric estimate uses 3M words of WSJ 1988 for training and 23M words of WSJ 1987 for testing. It confirms the trend with one exception: second sentences are unusually easy to predict. The authors tie this to corpus quirks, such as about 1.5% of second sentences opening with the same stock phrase about undisclosed terms.
- Per-word entropy rises with sentence number even for closed-class words (determiners, prepositions), not only for nouns and verbs. This points to non-lexical effects.
- A cache model (λ = 0.1) mixed with a smoothed trigram has the following effects:
- It lowers entropy clearly for nouns and slightly for verbs.
- It has no effect on closed-class words.
- So lexical repetition explains part of the effect, but only for open-class words.
- Late sentence positions have fewer samples, because most articles are short, so estimates there are less reliable.
Interesting ideas
- I1. Test an unmeasurable quantity through a measurable corollary. Good models of discourse context did not exist, so the authors derived a prediction about context-free entropy, which simple models can estimate. Testing the consequence instead of the hard quantity is a reusable strategy whenever the target variable is out of reach.
- I2. Assume model bias is roughly uniform and compare trends. Cross-entropy overestimates true entropy, but if the overestimate is similar across conditions, relative changes are still meaningful. The same logic applies when comparing positions, genres, or time periods with imperfect models.
- I3. Check robustness with several estimators. Agreement among an n-gram model, a parser-based model, and a non-parametric match-length estimator makes the finding less likely to be an artifact of any one model. It also helps reveal corpus-specific anomalies, like the second-sentence dip.
- I4. Use a cache as a diagnostic. Comparing a model with and without a word cache separates simple repetition effects from deeper usage effects. Splitting the result by part of speech adds a natural control, since closed-class vocabulary barely changes.
- I5. Position-indexed entropy curves as a discourse probe. Plotting sentence-level entropy against position in a document could be used to study how genres front-load or distribute information. The authors suggest such measurements might detect contextual relations like the given-new distinction.
Institutions
📚 Shelves 4The field of science this work belongs to (OpenAlex fields).Computer Science · 9,086 worksArtificial Intelligence · 8,889 worksArts and Humanities · 9,296 worksLanguage and Linguistics · 9,206 works
Cite
Cite as Dmitriy Genzel and Eugene Charniak. 2002. Entropy Rate Constancy in Text. Proceedings of the 40th Annual Meeting of the Association for Computational Linguistics.
@inproceedings{genzel2002entropy,
title = {{Entropy Rate Constancy in Text}},
author = {Dmitriy Genzel and Eugene Charniak},
booktitle = {Proceedings of the 40th Annual Meeting of the Association for Computational Linguistics},
year = {2002},
doi = {10.3115/1073083.1073117},
url = {https://doi.org/10.3115/1073083.1073117}
}References
- M. P. Aylett. 1999. Stochastic suprasegmentals: Relationships between redundancy, prosodic structure and syllabic duration. In Proceedings of ICPhS–99, San Francisco. find
- E. Charniak. 2001. A maximum-entropy-inspired parser. In Proceedings of ACL–2001, Toulouse.
- J. T. Goodman. 2001. A bit of progress in language modeling. Computer Speech and Language, 15:403–434. find
- I. Kontoyiannis, P. H. Algoet, Yu. M. Suhov, and A.J. Wyner. 1998. Nonparametric entropy estimation for stationary processes and random fields, with applications to English text. IEEE Trans. Inform. Theory, 44:1319–1327, May. find
- I. Kontoyiannis. 1996. The complexity and entropy of literary styles. NSF Technical Report No. 97, Department of Statistics, Stanford University, June. [unpublished, can be found at the author’s web page]. find
- R. Kuhn and R. De Mori. 1990. A cache-based natural language model for speech reproduction. IEEE Transactions on Pattern Analysis and Machine Intelligence, 12(6):570–583. find
- Nouns 9.5 normal caching 8.5 Prepositions 5.4 normal caching 5.2 4.8 4.6 Figure 3: Comparing Parts of Speech Verbs normal caching 10.5 9.5 Determiners normal caching 4.4 4.3 4.2 4.1 3.9 3.8 3.7 find
- M. P. Marcus, B. Santorini, and M. A. Marcinkiewicz. 1993. Building a large annotated corpus of English: the Penn treebank. Computational Linguistics, 19:313–330.
- J. B. Plotkin and M. A. Nowak. 2000. Language evolution and information theory. Journal of Theoretical Biology, pages 147–159. find
- C. E. Shannon. 1948. A mathematical theory of communication. The Bell System Technical Journal, 27:379–423, 623–656, July, October. find
Updated
This page in Markdown → https://md.research.elamur.ai/free/en/papers/genzel-2002-entropy-rate-constancy-text/