Heaps' Law¶

The empirical regularity that a corpus's distinct-word-type count grows as a sublinear power of the token count, V = K·N^β with β below 1, so vocabulary rises without bound ever more slowly and can be extrapolated across scale from two fitted parameters.

Version: v2 · 2026-09-06 · History
Domain-specific #: 497
Origin domain: linguistics semiotics
Subdomain: quantitative linguistics and information retrieval

Core Idea¶

Heaps' law (Harold Heaps 1978; independently described by Gustav Herdan 1960 as Herdan's law)^[1] is the empirical regularity that the vocabulary size V of a corpus — the count of distinct word types — grows as a sublinear power of the total token count N: V(N) = K · N^β, with β typically in the range 0.4–0.6 for natural-language text and K quoted, as a textbook rule of thumb rather than a property of the law, in the range 10–100.^[n1]^[n2] The growth is perpetual but decelerating: doubling the corpus multiplies the vocabulary by roughly 2^β ≈ 1.3–1.5, not 2, and there is no asymptote — even a very large corpus continues to produce new word types, increasingly rare ones. The mechanism behind the regularity is the Zipfian rank-frequency distribution of words: when the r-th most common word has frequency proportional to 1/r^α with α > 1, the expected type count at sample size N grows asymptotically as N^(1/α), so β = 1/α in the large-sample limit and the two laws are analytically coupled^[2] — Heaps' law is the cumulative-vocabulary projection of the same heavy-tailed generator whose frequency-rank face is Zipf's law. That coupling is an asymptotic result rather than an arithmetic identity, and it carries both a boundary and a caveat. The boundary: the reciprocal holds only for α > 1; for α ≤ 1 the relation does not invert but degenerates to β = 1, near-linear vocabulary growth. The caveat: applying it requires care about which α is meant, because natural-language rank-frequency curves are not a single pure power law but two-regime, with an exponent α₁ ≈ 1 across the core lexicon and a steeper α₂ ≈ 2 across the rare tail, and it is the rare tail that supplies the new types as a corpus grows. The observed β ≈ 0.4–0.6 is therefore consistent with the coupling once the tail exponent is the one used (β ≈ 1/α₂ ≈ 0.5); what fails is the single-exponent fit, which reciprocates the core-lexicon α₁ ≈ 1 — a value sitting on the boundary just described, where the relation degenerates rather than inverts — and so predicts near-linear vocabulary growth. What breaks on real text is thus the one-exponent idealization rather than the coupling itself, though even with the right regime chosen, independently fitted β and 1/α need not coincide on a finite corpus, where edge effects perturb the two estimates differently. The practical consequence in information retrieval is that the term dictionary of an inverted index grows sublinearly in corpus size, allowing system designers to predict dictionary memory at scale without simulating the corpus: given V₁ at N₁, the predicted vocabulary at N₂ is V₁ · (N₂/N₁)^β. The growth is also length-dependent for any vocabulary statistic computed from a finite sample: the type-token ratio V/N is not constant but declines as N^(β−1), so lexical-diversity measures require a Heaps correction to be comparable across corpus sizes.^[3]

Structural Signature¶

Sig role-phrases:

the discrete-type substrate — a process in which each observation samples one type (word, species, k-mer, identifier) from a potentially unbounded population
the heavy-tailed generator — the underlying Zipfian rank-frequency distribution over types (frequency ∝ 1/r^α, exponent α > 1) that drives the regularity
the cumulative-types counter — V, the count of distinct types seen as the token count N grows
the sublinear power form — the empirical law V = K·N^β with exponent β strictly below 1 (~0.4–0.6 for text) and prefactor K fitted per corpus, a textbook rule of thumb putting it at ~10–100^[n2]
the Zipf coupling — the asymptotic link β = 1/α, with α the rank-frequency exponent, tying Heaps' cumulative-vocabulary face to Zipf's frequency-rank face as two views of one generator
the no-saturation guarantee — V grows without bound (ever more slowly), so there is no "true vocabulary," only a sample-dependent estimate
the two-scalar sufficiency — K and β suffice for extrapolation V₂ = V₁·(N₂/N₁)^β, coverage-planning, and back-of-envelope provisioning without simulating the corpus
the length-dependence correction — the type-token ratio V/N declines as N^(β−1), so surface diversity statistics need a Heaps correction to compare across sample sizes
the precondition-validity boundary — the law holds exactly under heavy-tailed never-saturating sampling; over-reading begins where the type pool is bounded or the statistic converges to a finite limit

What It Is Not¶

Not a fundamental law. Despite the name, Heaps' law is an empirical regularity with fitted parameters (K, β), not a derived or universal law. It holds where its precondition holds — discrete-type sampling from a heavy-tailed generator — and β and K are estimated per corpus, not given by theory.
Not a causal mechanism. Heaps' law is a statistic, a description of how distinct-type count grows with sample size; it does not say vocabulary growth causes anything. It is in fact a consequence of the Zipfian rank-frequency distribution (β = 1/α in the asymptotic limit) — the cumulative-vocabulary projection of a heavy-tailed generator, not an independent force.
Not a claim that vocabulary converges to a true size. The growth is perpetual and unbounded: there is no asymptote and no "true vocabulary," only a sample-dependent estimate that rises ever more slowly. Asking "what is the vocabulary?" is ill-posed; the answerable question is "at what sample size, with what K and β?"
Not Zipf's law. The two are asymptotically coupled but distinct views of one generator: Zipf describes the rank-frequency fall-off of types at a fixed size, Heaps the cumulative count of distinct types as the sample grows. β = 1/α links them in the large-sample limit, with α the rank-frequency exponent; conflating the frequency-rank face with the vocabulary-growth face loses that the same parameter is being seen from two sides.
Not the constancy of the type-token ratio. Far from holding V/N fixed, Heaps' law predicts it declines as N^(β−1). The type-token ratio is therefore a length-dependent statistic, and the law supplies exactly the correction needed to compare lexical-diversity figures across corpus sizes — a comparison at unequal N is confounded, not a finding about richness.
Not a convergence law like the central limit theorem. Classical large-sample regularities describe convergence to a finite limit; Heaps' law describes unbounded sublinear growth, the signature of a heavy-tailed source. Projecting Heaps-style growth onto a process whose type pool is bounded or whose statistic converges to a finite limit is the characteristic misuse.

Scope of Application¶

Because Heaps' law is a statistic, not a causal mechanism, it is not bounded by a domain: it applies literally wherever its one precondition holds — discrete-type sampling from a heavy-tailed (Zipfian), never-saturating generator — and the habitats below are real uses of the identical construct (V = K·N^β, with only K and β re-estimated), not analogies. The boundary is precondition-validity, not substrate: over-reading begins the moment it is projected onto a process whose type pool is bounded or whose statistic converges to a finite limit (a central-limit-theorem-style regularity is outside its scope).

Corpus-vocabulary estimation — the home use in quantitative linguistics: distinct word types growing sublinearly in tokens, with the asymptotic β = 1/α coupling tying it to Zipf's law.
Inverted-index term-dictionary provisioning — predicting the dictionary memory of a search index at web scale from a small crawl via V₂ = V₁·(N₂/N₁)^β, without building the larger index.
Lexical-diversity comparison — the N^(β−1) correction that makes type-token-ratio (and richness) figures comparable across corpus sizes rather than confounded by length.
BPE / dictionary-based tokenizer training — projecting the sub-word vocabulary a larger pre-training corpus will require, and explaining why large tokenizers keep emitting unknown tokens.
Species accumulation (ecology) — distinct species discovered scaling as a power of sampling effort on a heavy-tailed abundance distribution. The exact counterpart of Heaps' law is the species-accumulation (rarefaction) curve, which counts individuals sampled; the more familiar species–area relationship (β ≈ 0.2–0.4) plots species against sampled area and takes the same form only once area is converted to individuals at an assumed constant density.^[n3]
k-mer discovery in genomic sequencing — distinct k-mers accumulating sublinearly in sequenced reads, a literal cumulative-type counter over heavy-tailed sampling.
Software-vocabulary growth — unique identifiers or functions growing sublinearly in lines of code.
Social-media type counts — distinct hashtags or distinct search queries growing sublinearly in posts, with the same extrapolation and coverage-planning toolkit.

Clarity¶

Naming the regularity as Heaps' law dissolves the intuition that a corpus has a vocabulary size — a fixed number one is converging on as the text grows. The law replaces that with a sample-dependent estimate that rises without bound, ever more slowly, so the practitioner stops asking "what is the vocabulary?" and asks the question that has an answer: at what sample size, with what K and β? That reframing makes a routine quantity — the term dictionary of an inverted index — predictable instead of mysterious: given the vocabulary at one corpus size, the vocabulary at another follows from the exponent alone, so memory at web scale can be provisioned without building the larger index. The naive linear projection, doubling the corpus to double the dictionary, is exposed as the specific error the law corrects.

Heaps' law also sharpens distinctions that surface vocabulary statistics blur. It separates vocabulary growth (distinct types as a function of sample size) from the rank-frequency profile (how those types are weighted at a fixed size), and the asymptotic link β = 1/α makes that separation precise — the same heavy-tailed generator is being viewed from two sides, the cumulative-vocabulary side and the frequency-rank side, rather than being two unrelated facts about words. Most consequentially for measurement, it exposes the type-token ratio as a length-dependent statistic: V/N declines as N^(β−1), so a lexical-diversity figure computed at one corpus size cannot be compared to one computed at another without correction. The sharper question this licenses is not "is this author's vocabulary richer?" but is the comparison being made at equal N, or has corpus length silently driven the difference? — turning an apparent finding about lexical richness into a question about whether the sublinear growth was accounted for.

Manages Complexity¶

The behaviour the law tames is vocabulary growth across the whole span of corpus sizes — a quantity that, taken empirically, is an open-ended curve: every increment of text produces some new types, increasingly rare, so the relationship between how much text one has read and how many distinct words one has seen is a fact that in principle must be re-measured at every scale and for every corpus. Heaps' law collapses that curve to two scalars, K and β: once those are fixed, the vocabulary at any sample size is read off the formula V = K·N^β rather than measured, and the vocabulary at a new size N₂ follows from the vocabulary at a known size N₁ by the single ratio (N₂/N₁)^β. The system designer therefore tracks just the exponent (and the prefactor) and reads off the quantities that matter — predicted term-dictionary size at web scale, the sample needed for a target coverage, the marginal rate at which novel terms must be added — without ever building the larger index. The whole high-dimensional question "how does this corpus's vocabulary behave as it grows?" reduces to estimating one power-law exponent and projecting from it.

The compression deepens because that exponent is not free-floating but coupled to the corpus's rank-frequency distribution: β = 1/α ties Heaps' law to Zipf's law in the asymptotic limit, so the cumulative-vocabulary face and the frequency-rank face are read off the same parameter rather than tracked as two independent regularities. An analyst who has one has the other, to within the accuracy of that limit. And the law converts a notorious source of confusion in lexical measurement into a single correction term: because the type-token ratio V/N is not constant but declines as N^(β−1), any diversity figure is silently a function of corpus length, and Heaps' law supplies the exact length-dependence needed to compare figures across sizes. The branch structure is correspondingly simple — for any vocabulary question the analyst asks only whether it is being posed at fixed N (a rank-frequency question, Zipf's side) or as N grows (a vocabulary-growth question, Heaps' side), and routes a lexical-richness comparison to "compare at equal N, or apply the N^(β−1) correction." What would be an endless ledger of vocabulary measurements at every scale reduces to two scalars, one asymptotic link to Zipf, and one length-correction, from which dictionary provisioning, coverage planning, and cross-corpus comparison all read off.

Abstract Reasoning¶

The law's signature move is extrapolation across scale from a partial sample. Having observed vocabulary V₁ at corpus size N₁, the analyst predicts the vocabulary at any other size by the single ratio V₂ = V₁·(N₂/N₁)^β, reasoning from a measured point and one exponent to an unmeasured point without building the larger corpus. The move is most consequential where it overrides the naive linear projection: doubling the corpus is predicted to multiply the dictionary by 2^β ≈ 1.3–1.5, not 2, so a search-index designer provisions term-dictionary memory at web scale from a small crawl, and a tokenizer trainer predicts the BPE vocabulary a larger pre-training corpus will require. The inverse of the same move is coverage planning: from a target vocabulary or coverage level, solve the formula for the required sample size N, reasoning from a desired V back to the N that yields it.

A diagnostic move corrects a standard error in lexical measurement by treating the type-token ratio as length-dependent. Because V/N declines as N^(β−1), an apparent finding that one author or genre has a "richer" vocabulary is suspect until the comparison is checked for equal N: the analyst reasons from a diversity figure to the question was this measured at the same corpus size, or has sublinear growth silently driven the difference?, and where sizes differ, applies the N^(β−1) correction before comparing. This converts a claim about lexical richness into a claim about whether corpus length was controlled — the surface statistic is read as confounded by sample size unless the Heaps correction has been made.

A cross-view move exploits the asymptotic coupling β = 1/α to infer one face of the heavy-tailed generator from the other: an analyst who has estimated the Zipf rank-frequency exponent α at fixed corpus size has thereby predicted the Heaps vocabulary-growth exponent β to within the accuracy of that limit, and vice versa, so the cumulative-vocabulary behaviour and the frequency-rank behaviour are not measured independently but derived from a shared parameter. Routing any vocabulary question first through "is this posed at fixed N (Zipf's rank-frequency side) or as N grows (Heaps' vocabulary-growth side)?" determines which face to use. A regime-and-boundary move reads β as a fingerprint of the generative substrate and fixes the law's scope: a β well below 1 signals a heavy-tailed, never-saturating generator (so the practitioner stops asking "what is the vocabulary?" — there is no fixed answer, only a sample-dependent estimate growing without bound — which is why even very large tokenizers keep emitting unknown tokens), whereas a process whose types are bounded would show saturation the law does not describe. The inference therefore runs from the fitted exponent to a claim about the kind of generator and the validity of extrapolating at all, with the law applying precisely to discrete-type sampling from a heavy-tailed source and not to large-sample processes that converge to a finite limit.

Knowledge Transfer¶

Heaps' law is a statistic, not a causal mechanism, so the usual "mechanism within the home domain, metaphor beyond it" framing does not apply: the construct transfers literally wherever its precondition holds — discrete-type sampling from a heavy-tailed (Zipfian) generator — and the boundary to police is instrument-reach versus over-reading, not analogy.

Within quantitative linguistics and information retrieval the law applies directly: the V = K·N^β form, the V₂ = V₁·(N₂/N₁)^β extrapolation, the asymptotic β = 1/α coupling to Zipf, and the N^(β−1) type-token-ratio correction all hold across corpus-vocabulary estimation, inverted-index term-dictionary provisioning, lexical-diversity comparison, and dictionary-based compression including BPE tokenizer training. None of this is metaphor; it is the same regularity computed on text.

Beyond language the transfer remains literal — this is the third-category case — because the same heavy-tailed-discrete-type structure recurs across substrates, and where it does, the law holds with only K and β re-estimated, not "applied by analogy." Species accumulation in ecology (distinct species discovered scaling as a power of sampling effort — Heaps' law exactly when the effort is counted in individuals; the more familiar species–area relationship, β ≈ 0.2–0.4, counts area instead and inherits the form only through a constant-density mapping)^[4]^[n3], k-mer discovery in genomic sequencing, the count of unique identifiers or functions growing sublinearly in lines of code, and the cumulative number of distinct hashtags or distinct search queries growing sublinearly in posts are all genuine co-instances: each is a cumulative-type counter over a heavy-tailed sampling process, and the extrapolation, coverage-planning, and length-correction moves transfer intact. What must be said honestly, though, is that this cross-substrate reach belongs to the underlying statistical construct, not to "Heaps' law" as a named linguistic regularity: the unifying object is the heavy-tailed/power_law_distribution/allometry_and_scaling_law cluster (with Zipf the frequency-rank face and the species–area relationship a sibling instance of the same scaling parent rather than the exact co-instance, which is the accumulation curve), and each field has independently developed the same shape under its own parameter names. So the portable content is the construct (sublinear power-law type-growth under heavy-tailed sampling) plus its toolkit — log-log parameter estimation, sample-size planning for target coverage, length-correction of surface ratios, extrapolation from partial samples — and the name travels only as a label of convenience.

The boundary that matters is therefore precondition validity, not substrate: the law is valid exactly where types are drawn from a heavy-tailed, never-saturating generator, and over-reading begins the moment it is applied to a process whose type pool is bounded or whose statistic converges to a finite limit. β read well below 1 is the fingerprint of a heavy-tailed source for which extrapolation is licensed; a process that saturates (or a classical large-sample regularity like the central limit theorem, which describes convergence rather than unbounded sublinear growth) is outside its scope, and projecting Heaps-style growth there is the characteristic misuse. The honest statement is thus that the construct transfers wherever heavy-tailed discrete-type sampling genuinely obtains — literally, as a measure — and that the discipline is to verify that precondition before extrapolating, rather than to assume the shape from a surface resemblance. (See Structural Core vs. Domain Accent.)

Examples¶

Canonical¶

Take a natural-language corpus in which a one-million-token sample (N₁ = 10⁶) yields 50,000 distinct word types (V₁ = 50,000) — figures in the neighbourhood of a classic reference collection like the Brown Corpus.^[n4] Fitting V = K·N^β with an assumed β = 0.5 fixes the prefactor: K = V₁ / N₁^β = 50,000 / (10⁶)^0.5 = 50,000 / 1000 = 50. The law now extrapolates without any further counting. Double the corpus to 2×10⁶ tokens and the predicted vocabulary is V₂ = 50,000 · (2×10⁶ / 10⁶)^0.5 = 50,000 · 2^0.5 ≈ 70,711 — a factor of about 1.41, not the naive doubling to 100,000. The gap between 70,711 and 100,000 is exactly the sublinear deceleration the law encodes: each doubling of text buys ever fewer new types, and no finite ceiling is ever reached.

Mapped back: Word types drawn from running text are the discrete-type substrate fed by a Zipfian heavy-tailed generator; V is the cumulative-types counter. The fit V = 50·N^0.5 is the sublinear power form, and β = 0.5 < 1 encodes the no-saturation guarantee. Predicting 70,711 rather than 100,000 from just K and β is the two-scalar sufficiency extrapolation, and β = 0.5 corresponds, in the asymptotic limit, to a Zipf rank-frequency exponent α = 1/β = 2 via the Zipf coupling — a limit relation rather than an arithmetic identity, and the α it refers to is the rare-tail exponent α₂ ≈ 2 of the two-regime rank-frequency curve, the regime that actually supplies the new types, not the core-lexicon α₁ ≈ 1 that a single fit across the whole rank range would report.

Applied / In Practice¶

Search-engine architects use exactly this to provision the term dictionary of an inverted index before building it. Suppose a pilot crawl of 10⁶ tokens produces a 50,000-term dictionary and the fitted exponent is again β = 0.5 (K = 50). To size the index for a billion-token collection (N₂ = 10⁹), the designer computes V₂ = 50,000 · (10⁹ / 10⁶)^0.5 = 50,000 · (1000)^0.5 ≈ 50,000 · 31.6 ≈ 1,581,000 distinct terms — enough to provision dictionary memory without ever assembling the billion-token index. The naive linear projection would have predicted 50,000 · 1000 = 50 million terms, over-provisioning by more than thirtyfold. The same sublinearity explains why large sub-word tokenizers trained with byte-pair encoding keep emitting unknown tokens on fresh text: the vocabulary never saturates.

Mapped back: The crawl's growing term set is the cumulative-types counter over a heavy-tailed generator of web text. Projecting ~1.58 million terms at 10⁹ tokens from a 10⁶-token pilot is the two-scalar sufficiency extrapolation V₂ = V₁·(N₂/N₁)^β doing real provisioning work, and the thirtyfold gap against 50 million exposes the linear projection as the error the sublinear power form corrects. Persistent unknown tokens are the no-saturation guarantee in production.

Structural Tensions¶

T1: Two-scalar extrapolation versus a drifting exponent (cheap projection assumes a constant β). The law's practical power is that K and β suffice to project vocabulary across orders of magnitude — from a 10⁶-token pilot to 10⁹ tokens by the single ratio (N₂/N₁)^β — without building the larger corpus. But that projection is only as good as the constancy of β, and real log-log vocabulary curves are frequently not perfectly straight: the exponent can drift with scale, so an estimate fit on a small crawl may over- or under-provision at web scale in exactly the regime where the extrapolation is doing the work no measurement checks. The tension is that the same two-scalar sufficiency that makes Heaps' law useful for provisioning bakes in a scale-invariance assumption the underlying process does not guarantee, and the further the extrapolation reaches, the more that unverified assumption carries the answer. Diagnostic: Is β stable across the range being extrapolated over, or is the fitted exponent itself drifting with sample size in this corpus?

T2: Asymptotic coupling to Zipf versus empirical divergence (β = 1/α as identity or limit relation). Stated as a bare formula, the coupling invites being read as an identity: Heaps and Zipf are two faces of one heavy-tailed generator, so estimating one looks as though it yields the other outright. The coupling is a genuine structural insight and a real economy. But it holds cleanly only in the asymptotic limit of a single pure power law, and a natural-language rank-frequency curve is two-regime — a core-lexicon α₁ ≈ 1 and a rare-tail α₂ ≈ 2 — so the relation has to be fed the tail exponent that actually drives type growth, and even then, on finite real corpora, the independently fitted Heaps exponent and the reciprocal of a fitted Zipf exponent routinely fail to coincide, because edge effects perturb each estimate differently. The tension is that treating β = 1/α as an identity lets the analyst derive one regularity from the other for free, while treating it as a limit relation warns that the two faces can disagree on the very corpus where both are measured. Leaning on the coupling trades a measurement for an assumption. Diagnostic: Which α is being reciprocated on this corpus — a single exponent fitted across the whole rank range, or the rare-tail exponent that governs vocabulary growth — and once the right one is used, does 1/α match the independently fitted β, or is the coupling standing in for a measurement that would differ?

T3: Unbounded growth versus a finite type pool (the no-saturation guarantee eventually fails). The law's signature commitment is that vocabulary rises without bound — there is no true vocabulary, only a sample-dependent estimate — and this correctly captures why large tokenizers keep emitting unknown tokens. Yet no real generator is genuinely inexhaustible: a language has finite morphological productivity, a genome's k-mer pool is bounded at exactly 4^k, an identifier namespace is finite. The never-saturating idealization is a good description across the practical range and false at the extreme, and the precondition-validity boundary the entry draws is precisely the point where extrapolating unbounded growth becomes the characteristic misuse. The tension is that the no-saturation guarantee is the source of the law's most useful predictions and also a claim that must break somewhere, with no marker inside the two-parameter fit announcing where. Diagnostic: Over the sample range in question, is the type pool effectively inexhaustible, or is it approaching a finite ceiling the power form will overshoot?

T4: Length-correction as fair comparison versus shared-exponent presumption (the fix that can confound what it compares). Heaps' law exposes the type-token ratio as length-dependent (V/N declines as N^(β−1)) and supplies exactly the correction needed to compare lexical-diversity figures across corpus sizes — turning an apparent richness finding into a question of whether N was controlled. But the correction presumes a β to apply, and if the two corpora being compared are generated by processes with different exponents — which is often precisely what a claim about differing lexical richness amounts to — then correcting both with one assumed β either erases the real difference or manufactures one. The tension is that the length-correction that makes cross-size comparison honest assumes a shared generator whose difference may be the very thing under test, so the tool meant to remove the confound can smuggle it back in. Diagnostic: Do the corpora being compared share an exponent, so one correction applies — or does their difference in β mean the length-correction is itself part of what is in dispute?

T5: Autonomy versus reduction (Heaps' law or the power-law scaling construct it names). Uniquely, Heaps' law is a statistic, not a causal mechanism, so it transfers literally wherever discrete-type sampling from a heavy-tailed generator holds — species accumulation, k-mer discovery, identifier growth, hashtag counts are co-instances, not analogies, with only K and β re-estimated. But that cross-substrate reach belongs to the underlying construct — the power_law_distribution / allometry_and_scaling_law cluster, with Zipf its frequency-rank face and the species–area relationship a sibling instance of that parent rather than the exact co-instance named above — each field having independently developed the same shape under its own names. The portable content is the construct plus its toolkit (log-log fitting, coverage planning, length-correction, extrapolation); "Heaps' law" travels only as a label of convenience. The tension is between a named linguistic regularity and the recognition that its generality is the parent construct's, not the name's. Diagnostic: Resolve toward the power_law_distribution/allometry_and_scaling_law construct when the sampling process is non-linguistic; toward "Heaps' law" when estimating or provisioning corpus vocabulary in situ.

Structural–Framed Character¶

Heaps' law sits toward the structural end of the spectrum — best read as mixed-structural, in the same family as the Hardy-Weinberg principle and Hartley's law: an evaluatively neutral statistical regularity whose construct transfers as genuine cross-substrate co-instances, kept off the pole only by the linguistic naming and vocabulary of the named instance.

On evaluative_weight it is at the structural extreme: V = K·N^β describes how a distinct-type count grows and praises or blames nothing. On human_practice_bound it is notably un-bound: although its home use counts word types (a human artifact), the identical construct governs species accumulation over individuals sampled and distinct-k-mer discovery in a genome, and its sibling form holds of something that is true whether or not anyone measures it — a larger tract of habitat carries more species than a smaller one, the species–area relationship — so the regularity it names is a fact about heavy-tailed discrete-type sampling wherever it occurs, not something a human practice constitutes; strip away the linguists and vocabularies still grow sublinearly, the larger island still holds the more species, k-mers still accumulate. On institutional_origin it is none: Heaps (and Herdan before him) described an empirical regularity, they did not legislate it; the "no true vocabulary" verdict is a consequence of the Zipfian generator, not an artifact of any survey or agency. On vocab_travels the named linguistic vocabulary (vocabulary size, word types, corpus, term dictionary) is domain-accented and must be re-labelled at each border, which is the framed-ward pull — but unusually, the construct itself travels almost intact (only K and β re-estimated), so the domain-specificity lives in the name more than in the mathematics. And on import_vs_recognize it patterns strongly structural: the entry is explicit that species accumulation, k-mer discovery, identifier growth, and hashtag counts are genuine co-instances, not analogies — the same statistic recognized on a new substrate, transferring literally rather than by metaphor, with the only boundary being precondition-validity (heavy-tailed, never-saturating) rather than substrate.

The portable structural skeleton is sublinear power-law type-growth under heavy-tailed sampling: distinct-type count rises as a power below one of sample size, without saturation, because the underlying frequency distribution is heavy-tailed — with the whole toolkit (log-log parameter fitting, extrapolation across scale, coverage planning, length-correction of surface ratios) riding along. That skeleton is substrate-general and recurs as recognized co-instances, and it is precisely what Heaps' law instantiates from its umbrella — the power_law_distribution / allometry_and_scaling_law cluster, with Zipf as the frequency-rank face (β = 1/α asymptotically) and the species–area relationship as a sibling instance of that parent — not what makes "Heaps' law" itself travel: the cross-substrate reach belongs to that scaling construct, of which Heaps' law is the quantitative-linguistics instance, while the vocabulary/token/corpus framing stays home. Its character: an evaluatively neutral, non-institutional statistical regularity governing observer-free heavy-tailed sampling, mixed-structural because the sublinear-power-law-type-growth construct it instantiates transfers literally as genuine cross-substrate co-instances, kept off the pole only by the linguistic vocabulary and the eponymous label of the named instance rather than by any limit on where the mathematics reaches.

Structural Core vs. Domain Accent¶

This section decides why Heaps' law is a domain-specific abstraction and not a prime, and it carries the case for its domain-specificity — there is no separate section for that. Its case is unusual: the construct itself is nearly substrate-free, so the domain-specificity lives more in the name than in the mathematics.

What is skeletal (could lift toward a cross-domain prime). Strip the linguistics and a thin relational structure survives, almost undiminished: the count of distinct types discovered rises as a power below one of the number of observations, without saturation, because the underlying frequency distribution over types is heavy-tailed. The pieces that travel are abstract: a discrete-type sampling process, a heavy-tailed (Zipfian) generator, a cumulative-distinct-type counter, and a sublinear power form V = K·N^β with its whole toolkit — log-log parameter fitting, extrapolation across scale, coverage planning, and length-correction of surface ratios. That skeleton is genuinely substrate-portable, which is exactly why the entry names the power_law_distribution / allometry_and_scaling_law cluster as the parent Heaps' law instantiates, with Zipf's law as the frequency-rank face (β = 1/α asymptotically) and the species–area relationship as a sibling instance of that parent. It recurs not as analogy but as genuine co-instances — species-accumulation curves (the exact ecological counterpart), k-mer discovery, identifier growth, hashtag counts. But it is the core Heaps' law shares, not what makes it distinctive.

What is domain-bound. What is domain-bound is unusually thin and lives mostly in the naming: the vocabulary size V as a count of distinct word types; the corpus and token framing; the term dictionary of an inverted index; the sub-word / BPE tokenizer vocabulary; and the eponymous label "Heaps' law" (and Herdan's) attached to the quantitative-linguistics instance. The decisive test here is not "remove the substrate and it dissolves" — because the construct survives extraction almost intact, needing only K and β re-estimated — but "remove the word-type framing and the name no longer fits": species accumulation (on a heavy-tailed abundance distribution), k-mer discovery, and hashtag growth are the same statistic wearing other domains' labels, and each field independently developed the same shape under its own parameter names. So the accent is the linguistic vocabulary, not the mathematics; the mathematics is portable, and only the name is home-bound.

Why this does not clear the prime bar. A prime is a relational structure whose vocabulary travels and whose transfer is recognition of the same mechanism, not analogy. Heaps' law is an unusual case because, as a statistic rather than a causal mechanism, it transfers literally wherever its precondition holds — but that is precisely why the portable content belongs to the parent construct, not to the named linguistic regularity. Within quantitative linguistics and information retrieval the law applies directly to corpus-vocabulary estimation, dictionary provisioning, lexical-diversity comparison, and tokenizer training. Beyond language it still applies literally — species accumulation, k-mer discovery, identifier growth, hashtag counts are co-instances, not metaphors — but there the practitioner is recognizing the general power_law_distribution / allometry_and_scaling_law construct, not importing "Heaps' law." So when the bare structural lesson — sublinear power-law type-growth under heavy-tailed sampling, extrapolable from two fitted scalars — is needed cross-domain, it is already carried, in more general form, by that scaling cluster (with Zipf its frequency-rank face). The cross-domain reach belongs to the parent construct; "Heaps' law," as named, travels only as a label of convenience for the quantitative-linguistics instance, its word-type/corpus/term-dictionary vocabulary staying home.

Relationships to Other Abstractions¶

Current abstraction Heaps' Law Domain-specific

Parents (2) — more general patterns this builds on

Heaps' Law is a kind of Allometry and Scaling Law Prime

Heaps' Law is the discrete-type-growth specialization of an allometric scaling law, with distinct types scaling as a power of accumulated observations.
Heaps' Law presupposes Heavy-Tailed Distributions Prime

Heaps' Law presupposes a heavy-tailed type-frequency generator whose many rare types keep entering the cumulative count as the sample grows.

Children (1) — more specific cases that build on this

Type-Token Ratio Domain-specific presupposes Heaps' Law

The guarded interpretation of Type-Token Ratio presupposes Heaps' Law because sublinear vocabulary growth is what makes raw V/N decline with sample length and determines the correction.

Hierarchy paths (2) — routes to 2 parentless roots

Heaps' Law → Allometry and Scaling Law → Scaling and Scale Dependence → Scale

Show alternative path (1)

Neighborhood in Abstraction Space¶

Heaps' Law sits in a sparse region of the domain-specific corpus (67^th percentile for distinctiveness): few abstractions share its structure, so a faithful description tends to retrieve it precisely.

Family — Unclustered & Miscellaneous (1565 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-09-08

Not to Be Confused With¶

Zipf's law. The frequency-rank face of the same heavy-tailed generator: it describes how token frequencies fall off with rank at a fixed corpus size (the r-th most common word has frequency ∝ 1/r^α, with α near 1 over the core lexicon and nearer 2 over the rare tail; α throughout this entry is that rank-frequency exponent, never the exponent of the frequency distribution over types), whereas Heaps' law describes the cumulative count of distinct types as the sample grows. They are asymptotically coupled — β = 1/α in the large-sample limit, for α > 1, with the degenerate branch β = 1 for α ≤ 1 — but view one generator from opposite sides, and on a finite corpus the two exponents fitted independently need not satisfy the relation. Tell: is the question how often each type occurs at a fixed size (Zipf), or how many distinct types have appeared as the sample grows (Heaps)?
Herdan's law. Not a different law but the same law under another name — Gustav Herdan described the vocabulary-growth regularity in 1960, independently of and before Heaps (1978). The names are used interchangeably (sometimes "Herdan–Heaps law"), and any distinction is one of priority and disciplinary lineage, not of content. Tell: if the object is sublinear distinct-type growth V = K·N^β, "Herdan's law" and "Heaps' law" name the identical regularity.
Species-accumulation curve and the species–area relationship (ecology). The ecological co-instance is the species-accumulation (rarefaction) curve — distinct species discovered as a power of the number of individuals sampled. That curve is not a separate law analogous to Heaps but the same statistic on a different substrate, with only K and β re-estimated — but only where the abundance distribution is heavy-tailed. Under a log-series abundance distribution, Fisher's classic ecological case, the individual-based curve is not a power law at all but logarithmic: S = α·ln(1 + n/α), where α is the log-series diversity parameter rather than the Zipf exponent used elsewhere in this entry. The more familiar species–area relationship (β ≈ 0.2–0.4) plots species against sampled area instead, so it coincides with the Heaps form only through a mapping from area to individuals — in practice, an assumption of constant density.^[n3] Tell: is the accumulating unit individuals sampled (species-accumulation curve, Heaps' law on ecological data), sampled area (species–area relationship, one density assumption away), or tokens accumulating word types (Heaps proper)?
Type-token ratio (TTR). The lexical-diversity metric V/N (distinct types over total tokens). Heaps' law is not this ratio; it predicts that the ratio is length-dependent, declining as N^(β−1), and supplies the correction needed to compare TTR across corpus sizes. TTR is the confounded surface statistic; Heaps' law is the growth law that explains and corrects it. Tell: are you naming a single diversity number computed at one size (TTR), or the power law governing how that number changes with sample size (Heaps)?
Central limit theorem / law of large numbers. Classical large-sample regularities describing convergence to a finite limit (a sample mean settling toward the true mean). Heaps' law describes the opposite signature — unbounded sublinear growth with no asymptote — because its source is heavy-tailed. Projecting Heaps-style growth onto a process that actually converges (or vice versa) is the characteristic misuse. Tell: does the statistic settle toward a fixed value as the sample grows (CLT / LLN regime), or keep rising without bound ever more slowly (Heaps regime)?
Power-law distribution / allometry and scaling-law cluster (umbrella). The substrate-neutral parent Heaps' law instantiates — sublinear power-law type-growth under heavy-tailed sampling, with the whole log-log fitting, extrapolation, and length-correction toolkit — of which Zipf is the frequency-rank face and the species–area relationship a sibling instance. The umbrella carries the cross-substrate reach (the construct transfers literally, only K and β re-estimated); Heaps' law adds the vocabulary/token/corpus framing that stays home. Tell: strip away the word-type labels and what remains is bare sublinear power-law growth from a heavy-tailed source — the scaling parent, of which Heaps' law is the linguistics instance. (Treated fully in a later section.)

Notes¶

[n1] Citation pending. This claim has not yet been matched to a source that could be verified, so it is recorded as an open gap rather than presented as settled. Work to substantiate it is ongoing. See how references were verified for what verification here does and does not establish. ↩

[n2] The 10–100 span is a textbook rule of thumb, not a property of the law. Unlike β, K is not scale-free: it is the vocabulary predicted at N = 1, so its numerical value moves with the units N is counted in — tokens, thousands of tokens, characters — and with the tokenization that decides what counts as a type at all (case-folding, lemmatization, sub-word splitting, whether numbers and punctuation are types). It also moves with the range over which the curve was fitted, because a log-log fit trades K against β and a real vocabulary curve is not perfectly straight. K values from different studies are therefore not comparable unless both the units and the tokenization are the same, and the range is best read as the neighbourhood the usual conventions on English text tend to land in. ↩a ↩b

[n3] Under a strictly constant density of individuals across the sampled area the two ecological curves coincide exactly: N ∝ A turns S ∝ A^z into S ∝ N^β with β = z, so the area-to-individuals mapping preserves the exponent. Real communities break that assumption — density varies and individuals are spatially aggregated, so a given area holds fewer distinct species than a random draw of the same number of individuals would, and the area-based curve on one community rises more slowly than the individual-based one. That, and not the density assumption, is why the two exponents differ in practice, and why nested-quadrat, island and individual-based curves are conventionally fitted and reported separately. The identity claimed here runs through the accumulation curve; the species–area form inherits it only under that mapping. ↩a ↩b ↩c

[n4] Citation pending. This claim has not yet been matched to a source that could be verified, so it is recorded as an open gap rather than presented as settled. Work to substantiate it is ongoing. See how references were verified for what verification here does and does not establish. ↩

References¶

[1] Heaps, H. S. Information Retrieval: Computational and Theoretical Aspects. Academic Press, 1978. Heaps (1978) establishes the eponymous 1978 publication; the Herdan 1960 / 'independently described' half of the sentence is not supported by any source attached to this marker and needs a companion citation (e.g., Herdan, Type-Token Mathematics, 1960). registry ↩

[2] Lü, Zhang, and Zhou. “Zipf's Law Leads to Heaps' Law: Analyzing Their Relation in Finite-Size Systems”. PLoS ONE, 2010. Lü, Zhang & Zhou (2010) establish that β=1/α is an asymptotic, large-size-limit relation that degenerates to β=1 for α≤1; the two-regime core-lexicon/rare-tail account of natural-language Zipf exponents used here to reconcile that coupling with observed β≈0.4–0.6 is not this paper's finding and needs a separate source (e.g., empirical work on the two-piece structure of word-frequency rank curves). registry ↩

[3] Tweedie and Baayen. “How Variable May a Constant be? Measures of Lexical Richness in Perspective”. Computers and the Humanities, 1998. Tweedie & Baayen (1998) demonstrate that type-token ratio and related lexical-richness measures are sample-size dependent and not comparable across corpora without a Heaps-law-based correction. registry ↩

[4] MacArthur, Robert H. and Wilson, Edward O. The Theory of Island Biogeography. Princeton University Press, 1967. MacArthur & Wilson (1967) establish the species-area power law and island z-values in the canonical ≈0.20–0.35 neighborhood; the article's widened upper bound of 0.4 is not well supported by this source and is closer to figures from later broader surveys (e.g., Connor & McCoy, 1979). This source covers only the area-based half of the marked sentence: the individual-based species-accumulation (rarefaction) claim that the sentence leads with is not from MacArthur & Wilson and needs a rarefaction reference (e.g., Gotelli & Colwell, 2001). registry ↩