Approximate string matching

Known as: Fuzzy search, Fuzzy searching, Fuzzy string searching

In computer science, approximate string matching (often colloquially referred to as fuzzy string searching) is the technique of finding strings that…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2009

We develop a method for performing boolean convolutions efficiently in word RAM model of computation, having a word size of $w…

2008

Abstract Approximate string matching is about finding a given string pattern in a text by allowing some degree of errors. In this…

2008

In this paper, an efficient FPGA-based hardware algorithm and its extensions are proposed for calculating the edit distance as a…

2004

were required, (2) disambiguation failed because of missing synonyms, e.g. ”vertebrate” and (3) for several cases the provided…

2003

In this paper we give the first, to our knowledge, structures and corresponding algorithms for approximate indexing, by…

2001

The approximate string matching problem is to find all locations which a pattern of length m matches a substring of a text of…

1999

We present a new indexing method for the approximate string matching problem. The method is based on a suffix tree combined with…

1997

Most research on the edit distance problem and the k-differences problem considered the set of edit operations consisting of…

1995

Approximate string matching is a sequential problem and therefore it is possible to solve it using finite automata. A…

1995

The edit distance between two strings a1, ..., a/sub m/ and b/sub 1/, ..., b/sub n/ is the minimum cost s of a sequence of…