Zipf & Heap — Text Law Analyzer

Input Texttype to analyze in realtime
Preprocessing
Zipf's Law
Heap's Law
Tokens
—
Vocabulary
—
Slope (s)
—
R²
—
Top Words—
RankWordFreqf × r
No data yet
Log–Log Plotrank → freq
Observed
Zipf fit
Tokens (N)
—
Vocab (V)
—
K
—
β
—
Sample Points—
NV(N)K·N^βΔ%
No data yet
Vocabulary vs TokensN → V
Observed
K · N^β