On the role of autocorrelations in texts
| dc.creator | Lande, D. V. | |
| dc.creator | Snarskii, A. A. | |
| dc.date | 2007-10-01 | |
| dc.date.accessioned | 2026-07-07T08:33:15Z | |
| dc.date.available | 2026-07-07T08:33:15Z | |
| dc.description | The task of finding a criterion allowing to distinguish a text from an arbitrary set of words is rather relevant in itself, for instance, in the aspect of development of means for internet-content indexing or separating signals and noise in communication channels. The Zipf law is currently considered to be the most reliable criterion of this kind [3]. At any rate, conventional stochastic word sets do not meet this law. The present paper deals with one of possible criteria based on the determination of the degree of data compression. | |
| dc.description | 5 pages, 4 figures, 5 references | |
| dc.identifier | https://arxiv.org/abs/0710.0225 | |
| dc.identifier | http://arxiv.org/abs/0710.0225 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/139064 | |
| dc.subject | Computation and Language | |
| dc.title | On the role of autocorrelations in texts | |
| dc.type | text |