# A Two Parameters Equation for Word Rank-Frequency Relation

arXiv: https://arxiv.org/abs/2205.00638 · HTML: https://mlsanity.com/paper/2205.00638/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- Builds on 0 of its 8 references that are in the map.
- First posted on arXiv 2 May 2022.

## Built on by (most cited first, 1 of 1)

- [A Crucial Parameter for Rank-Frequency Relation in Natural Languages](https://mlsanity.com/paper/2402.00271/) (2024)

## Abstract (arXiv)

Let f (·) be the absolute frequency of words and r be the rank of words in decreasing order of frequency, then the following function can fit the rank-frequency relation [ f (r;s,t) = left(fracrtt maxrright)1-s left(fracrtt max+t · rtt expr+t · rtt expright)1+(1+t)s ] where rtt max and rtt exp are the maximum and the expectation of the rank, respectively; s>0 and t>0 are parameters estimated from data. On well-behaved data, there should be s<1 and s · t < 1.