We present the rst known case of one-dimensional and two-dimensional string matching algorithms for text with bounded entropy. Let n be the length of the text and m be the length of the pattern. We show that the expected complexity of the algorithms is related to the entropy of the text for various assumptions of the distribution of the pattern. For the case of uniformly distributed patterns, o...

Advances in computational linguistics and discourse processing have made it possible to automate many language- and text-processing mechanisms. We have developed a computer tool called Coh-Metrix, which analyzes texts on over 200 measures of cohesion, language, and readability. Its modules use lexicons, part-of-speech classifiers, syntactic parsers, templates, corpora, latent semantic analysis,...

In this paper, we introduce a new digital watermarking algorithm using least significant bit (LSB). LSB is used because of its little effect on the image. This new algorithm is using LSB by inversing the binary values of the watermark text and shifting the watermark according to the odd or even number of pixel coordinates of image before embedding the watermark. The proposed algorithm is flexib...

We present a technique that exploits the multiplicity of the ways a text may be encoded using an LZ77-based compression method. With such methods, repeated parts of the text are encoded as length-distance pairs that refer to previously seen text. In general, given the maximum length of a repeated part, there may be more than one distance at which there is a copy of the repeated part. The compre...

A well-established principle of language is that there is a preference for closely related words to be close together in the sentence. This can be expressed as a preference for dependency length minimization (DLM). In this study, we explore quantitatively the degree to which natural languages reflect DLM. We extract the dependencies from natural language text and reorder the words in such a way...

Two studies were conducted to determine the extent to which young children fixate on the print of storybooks during shared book reading. Children's books varying in the layout of the print and the richness of the illustrations were displayed on a computer monitor. Each child's mother or preschool teacher read the books while the child sat on the adult's lap wearing an EyeLink headband that reco...

The Lempel-Ziv factorization (LZ77) and the Run-Length encoded BurrowsWheeler Transform (RLBWT) are two important tools in text compression and indexing, being their sizes z and r closely related to the amount of text self-repetitiveness. In this paper we consider the problem of converting the two representations into each other within a working space proportional to the input and the output. L...

Text based pictures called text art or ASCII art can be noise in text processing and display of text, though they enrich expression in Web pages, email text and so on. With text art extraction methods, which detect text art areas in a given text data, we can ignore text arts in a given text data or replace them with other strings. We proposed a text art extraction method with Run Length Encodin...

This paper presents a novel algorithm for eliminating class noise based on the analysis of the feature class attribute in text classification. The algorithm can eliminate class noise for classifier by mining the most representative class information of text features, which means that the algorithm can actively prejudge the candidate class labels to unseen documents using the class attribute lin...

In the string-searching problem we have a pattern pat, of length m, all occurrences of which are to be found in a text string text, of length n (usually n m). This problem has been studied extensively; see e.g. Reference 1. One of the fastest known algorithms is that of Boyer and Moore . 2 The theoretical time complexity (measured in the number of symbol comparisons) of the method is O ( n + rm...