We introduce a new automaton on a word p, sequence of letters taken in an alphabet Σ, that we call factor oracle. This automaton is acyclic, recognizes at least the factors of p, has m +1 states and a linear number of transitions. We give an on-line construction to build it. We use this new structure in string matching algorithms that we conjecture optimal according to the experimental results....

We introduce a new dimension to the widely studied on-line approximate string matching problem, by introducing an error threshold parameter so that the algorithm is allowed to miss occurrences with probability . This is particularly appropriate for this problem, as approximate searching is used to model many cases where exact answers are not mandatory. We show that the relaxed version of the pr...

Suux arrays and suux binary search trees are two data structures that have been proposed as alternatives to the classical suux tree to facilitate eecient on-line string searching. Here, we explore the relationship between these two structures. In particular, we present an alternative view of a suux array, with its auxiliary information, as a perfectly balanced suux binary search tree, and descr...

Contemporary spammers commonly seek to defeat statistical spam filters through the use of word obfuscation. Such methods include character level substitutions, repetitions, and insertions to reduce the effectiveness of word-based features. We present an efficient method for combating obfuscation through the use of inexact string matching kernels, which were first developed to measure similarity...

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...

Despite being a controversial topic, research into a wide variety of online addictions has grown substantially over the last decade (1, 2). My own research into online addictions has been wide ranging and has included online social networking [e.g., Ref. (3)], online sex addiction (4), online gaming addiction [e.g., Ref. (5)], online shopping addiction (6), and online gambling addiction [e.g., ...

In 1973 F. W. Lancaster published the first textbook about online information retrieval (with E. G. Fayen). That text and his later writings and books on the topics relating to online searching set the precedent for many books to follow. His early work also advocated many changes to the state-of-the-art systems and anticipated many of the characteristics of modern online information retrieval s...