title: Long-Range Memory in Literary Texts: On the Universal Clustering of the Rare Words.
abstract: A fundamental problem in linguistics is how literary texts can be quantified mathematically. It is well known that the frequency of a (rare) word in a text is roughly inverse proportional to its rank (Zipf's law). Here we address the complementary question, if also the rhythm of the text, characterized by the arrangement of the rare words in the text, can be quantified mathematically in a similar basic way. To this end, we consider representative classic single-authored texts from England/Ireland, France, Germany, China, and Japan. In each text, we classify each word by its rank. We focus on the rare words with ranks above some threshold Q and study the lengths of the (return) intervals between them. We find that for all texts considered, the probability SQ(r) that the length of an interval exceeds r, follows a perfect Weibull-function, SQ(r) = exp(-b(β)rβ), with β around 0.7. The return intervals themselves are arranged in a long-range correlated self-similar fashion, where the autocorrelation function CQ(s) of the intervals follows a power law, CQ(s) ∼ s-γ, with an exponent γ between 0.14 and 0.48. We show that these features lead to a pronounced clustering of the rare words in the text.
authors.affiliation: The University of Tokyo, Research Center for Advanced Science and Technology, Tokyo, 153-8904, Japan.
authors.forename: Kumiko
authors.initials: K
authors.lastname: Tanaka-Ishii
authors.affiliation: Universität Giessen,Institut für Theoretische Physik,Giessen,35392, Germany.
authors.forename: Armin
authors.initials: A
authors.lastname: Bunde
mesh_terms: D016000:Cluster Analysis; D004739:England; D005602:France; D005858:Germany; D006801:Humans; D007494:Ireland; D007802:Language; D008037:Linguistics / Q000379:methods*; D008432:Mathematical Computing; D008962:Models, Theoretical; D011336:Probability; D014825:Vocabulary