Abstract
The present paper introduces a novel object of study, a language fractal structure; we hypothesize that a set of embeddings of all n‐grams of a natural language constitutes a representative sample of this fractal set. (We use the term Hailonakea to refer to the sum total of all language fractal structures, over all n). The paper estimates intrinsic (genuine) dimensions of language fractal structures for the Russian and English languages. To this end, we employ methods based on (1) topological data analysis and (2) a minimum spanning tree of a data graph for a cloud of points considered (Steele theorem). For both languages, for all n, the intrinsic dimensions appear to be noninteger values (typical for fractal sets), close to 9 for both of the Russian and English language.
Funder
National Research University Higher School of Economics