Approximate string matching

About: Approximate string matching is a research topic. Over the lifetime, 1903 publications have been published within this topic receiving 62352 citations. The topic is also known as: fuzzy string-searching algorithm & fuzzy string-matching algorithm.

Computing the maximal-exponent repeats of an overlap-free string in linear time

Abstract: The exponent of a string is the quotient of the string's length over the string's smallest period. The exponent and the period of a string can be computed in time proportional to the string's length. We design an algorithm to compute the maximal exponent of factors of an overlap-free string. Our algorithm runs in linear-time on a fixed-size alphabet, while a naive solution of the question would run in cubic time. The solution for non overlap-free strings derives from algorithms to compute all maximal repetitions, also called runs, occurring in the string. We show there is a linear number of maximal-exponent repeats in an overlap-free string. The algorithm can locate all of them in linear time.

Matching fuzzy quantities

Abstract: A characteristic approach of approximate reasoning is the partial matching of observations to prototypes. This analysis is cast in the framework of fuzzy set theory and brings another dimension to the fuzzy matching criterion; this dimension is the measure of uncertainty through the concept of subjective entropy. While a similarity measure, in the matching process, activates relevant prototypes, the entropy formalism derived provides a measure of uncertainty in the partial matching to each prototype. The novel approach formalizes an entropy weights activation of prototypes for fuzzy partial matching. A methodology is developed for matching of observation to a set of prototypes making use of a suitable aggregation done with a framework of fuzzy integrals. A method of dealing with compound hypothesis is also developed. >

A fast algorithm for finding the nearest neighbor of a word in a dictionary

Abstract: A new algorithm for string edit distance computation is proposed. It needs time that is only linear in the length of one of the two strings to be matched, provided that the other string has undergone some preprocessing in an off-line phase. The algorithm can be extended to matching a word against a dictionary of any size. In this case the time complexity is independent of the length of the dictionary words, and the number of entries in the dictionary. >

Efficient string algorithmics

Abstract: Problems involving strings arise in many areas of computer science and have numerous practical applications. We consider several problems from a theoretical perspective and provide efficient algorithms and lower bounds for these problems in sequential and parallel models of computation. In the sequential setting, we present new algorithms for the string matching problem improving the previous bounds on the number of comparisons performed by such algorithms. In parallel computation, we present tight algorithms and lower bounds for the string matching problem, for finding the periods of a string, for detecting squares and for finding initial palindromes.