The visual span in reading is the number of characters that can be recognized at a glance. The shrinking visual span hypothesis attributes reading deficits in low vision, and slow reading in normal vision at low contrast, to a reduction in the visual span. This hypothesis predicts that reading time (msec/word) becomes increasingly dependent on word length as text contrast decreases. We tested a...

We present an online algorithm to deal with pattern matching in strings. The problem we investigate is commonly known as „string matching with mismatches‟ in which the objective is to report the number of characters that match when a pattern is aligned with every location in the text. The novel method we propose is based on the frequencies of individual characters in the pattern and the text. G...

In this paper we describe our solution to the WSDM Cup 2017 Triple Scoring task. Our approach generates a relevance score based on the textual description of the triple’s subject and value (Object). It measures how similar (related) the text description of the subject is to the text description of its values. The generated similarity score can then be used to rank the multiple values associated...

Consider the preex matching problem: Given a pattern P of length m and a text T of length n, nd for all positions i in T the longest preex of P starting at i. We present a parallel algorithm for the preex matching problem over general alphabets whose text search takes optimal O((m)) time and preprocessing takes optimal O(log log m) time, where (m) is the inverse Ackermann function. An (log log ...

We consider the combination of function and permuted matching, each of which has fast solutions in their own right. Given a pattern p of length m and a text t of length n, a function match at position i of the text is a mapping f from Σp to Σt with the property that f(pj) = ti+j−1 for all j. We show that the problem of determining for each substring of the text, if any permutation of the patter...

A novel random text generation model is introduced. Unlike in previous random text models, that mainly aim at producing a Zipfian distribution of word frequencies, our model also takes the properties of neighboring co-occurrence into account and introduces the notion of sentences in random text. After pointing out the deficiencies of related models, we provide a generation process that takes ne...

We are interested in the exact string matching problem which consists of searching for all the occurrences of a pattern of length m in a text of length n. Both the pattern and the text are built over an alphabet of size. We present three versions of an exact string matching algorithm. They use a new shifting technique. The rst version is straightforward and easy to implement. The second version...

This paper is concerned with the wave length λ of smooth periodic traveling wave solutions of the Camassa-Holm equation. The set of these solutions can be parametrized using the wave height a (or "peak-to-peak amplitude"). Our main result establishes monotonicity properties of the map [Formula: see text], i.e., the wave length as a function of the wave height. We obtain the explicit bifurcation...

For several reasons machine translation systems are today unsuited to process long texts in one shot. In particular, in statistical machine translation, heuristic search algorithms are employed whose level of approximation depends on the length of the input. Moreover, processing time can be a bottleneck with long sentences, whereas multiple text chunks can be quickly processed in parallel. Henc...

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 the third and the fourth least significant bits (LSB) technique and shifting the watermark of pixel coordinates of image before embedding the watermark. The proposed algorithm is flexible depending on the length of th...