A Two Parameters Equation for Word Rank-Frequency Relation

05/02/2022
by   Chenchen Ding, et al.
0

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) = (r_ max/r)^1-s(r_ max+t · r_ exp/r+t · r_ exp)^1+(1+t)s where r_ max and r_ 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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/09/2014

Zipf's Law and the Frequency of Characters or Words of Oracles

The article discusses the frequency of characters of Oracle,concluding t...
research
02/07/2021

Word frequency-rank relationship in tagged texts

We analyze the frequency-rank relationship in sub-vocabularies correspon...
research
08/11/2021

Automatic Sequences of Rank Two

Given a right-infinite word x over a finite alphabet A, the rank of x is...
research
11/23/2018

Rank-frequency distribution of natural languages: a difference of probabilities approach

The time variation of the rank k of words for six Indo-European language...
research
05/05/2020

Self-organizing Pattern in Multilayer Network for Words and Syllables

One of the ultimate goals for linguists is to find universal properties ...
research
02/03/2020

A note on the parametric integer programming in the average case: sparsity, proximity, and FPT-algorithms

We consider the Integer Linear Programming (ILP) problem max{c^ x : A x ...
research
05/09/2022

Approaches to the classification of complex systems: Words, texts, and more

The Chapter starts with introductory information about quantitative ling...

Please sign up or login with your details

Forgot password? Click here to reset