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.

2010

The approximate string matching problem consists in finding all locations at which a pattern P of length m matches a substring of…

2010

We present a novel exact solution to the approximate string matching problem in the context of translation memories, where a text…

2008

Consider a text SŒ1 : : : n over a finite alphabet . The problem is to build an index for S such that for any query pattern P Œ1…

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…

2001

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

2000

Addresses the problem of approximate string matching on compressed text. We consider this problem for a text string described in…

1999

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

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…

1995

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