Zipf Distributions from Two-Stage Symbolic Processes: Stability Under Stochastic Lexical Filtering

Vladimir Berman
11/26/2025
stat.MEcs.CLstat.ML

No confident code implementation found for this paper.

Abstract

Zipf's law in language lacks a definitive origin, debated across fields. This study explains Zipf-like behavior using geometric mechanisms without linguistic elements. The Full Combinatorial Word Model (FCWM) forms words from a finite alphabet, generating a geometric distribution of word lengths. Interacting exponential forces yield a power-law rank-frequency curve, determined by alphabet size and blank symbol probability. Simulations support predictions, matching English, Russian, and mixed-genre data. The symbolic model suggests Zipf-type laws arise from geometric constraints, not communicative efficiency.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{berman2025zipf,
  title  = {Zipf Distributions from Two-Stage Symbolic Processes: Stability Under Stochastic Lexical Filtering},
  author = {Vladimir Berman},
  year   = {2025},
  eprint = {2511.21060},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2511.21060v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2511.21060.svg)](https://codeofpaper.com/paper/2511.21060)

Discussion