We investigate the maximal length of repeat as a function of the text length in ten English texts. The maximal length of repeat in the experimental data is greater than a power of the logarithm of the text length where the exponent is close to 2. This result indicates that English prose cannot be modeled by a finite-energy stochastic process, differently than we have previously assumed.

This contribution examines the macro quantitative features of 15 lowfrequency word classes. The relationship between word frequency classes and the sizes of the frequency classes obeys Altmann’s power law, and the sizes of lowfrequency word classes increase along with the increase of text length. The relationship between text length and the sizes of low-frequency word classes also obeys Altmann...

String matching is the problem of finding all the occurrences of a string, called the pattern, within another, called the text. We give sharp bounds when only one head moving from the left to the right of the text is used, for the general case where the alphabet is unknown to the algorithms : b(2 − 1 m) nc comparisons between pattern characters and text characters, and min{1 + blog2mc, card(A)}...

From the earliest days of generative grammar, developing a general method for grammar acquisition has been a major goal of linguistic theory. Chomsky (1975) proposed that grammars be selected for their simplicity: the simplest grammar which fits the data is the best one. At that time, no computationally useful definition of simplicity has been available. Recently, the method variously known as ...

Evidence is presented for a systematic text-length dependence of the power-law index γ of a single book. The estimated γ values are consistent with a monotonic decrease from 2 to 1 with increasing text length. A direct connection to an extended Heap’s law is explored. The infinite book limit is, as a consequence, proposed to be given by γ = 1 instead of the value γ = 2 expected if Zipf’s law is...

The usage of web shows the importance of usability and readability of the web applications. Web application fails to encounter the user’s requirements in effective manner, because the designers are unaware of some of the important factors affecting readability, reading from the screen. Although focus losses at two positions, when eye blink, middle of text line and when text line ends, specifyin...

In this paper, we present the following results: (1) We propose a new dynamic compressed index of O(w) space, that supports searching for a pattern P in the current text in O(|P | logw+logw log |P | logN(log M)+occ logN) time and insertion/deletion of a substring of length y in O((y + logN log M) logw logN log M) time, where N is the length of the current text, M is the maximum length of the dy...

We present a simple and fast deterministic solution to the string matching with don’t cares problem. The task is to determine all positions in a text where a pattern occurs, allowing both pattern and text to contain single character wildcards. Our algorithm takes O(n logm) time for a text of length n and a pattern of length m and in our view the algorithm is conceptually simpler than previous a...

OBJECTIVE The objective of this study was to establish basic reading performance that could lead to useful design recommendations for print display text formats and layouts for the improvement of reading and comprehension performance of print text, such as academic writings, books, and newspapers, of Arabic language. BACKGROUND Readability of English print text has been shown to be influenced...