Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

33 relations
Acoustic fingerprintBK-treeBitap algorithmComputer science

Broader (2)

Dynamic programmingPattern matching

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2010
2010
Approximate String Matching Allowing for Inversions and Translocations
The approximate string matching problem consists in finding all locations at which a pattern P of length m matches a substring of… 
2008
2008
Indexed Approximate String Matching
  • W. Sung
  • Encyclopedia of Algorithms
  • 2008
  • Corpus ID: 34176191
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… 
2004
2004
ProMiner: Organism-specific protein name detection using approximate string matching
were required, (2) disambiguation failed because of missing synonyms, e.g. ”vertebrate” and (3) for several cases the provided… 
2002
2002
New and faster filters for multiple approximate string matching
We present three new algorithms for on‐line multiple string matching allowing errors. These are extensions of previous algorithms… 
2001
2001
Faster approximate string matching over compressed text
Approximate string matching on compressed text was an open problem for almost a decade. The two existing solutions are very new… 
Highly Cited
2001
Highly Cited
2001
A Randomized Algorithm for Approximate String Matching
Abstract. We give a randomized algorithm in deterministic time O(Nlog  M) for estimating the score vector of matches between a… 
2001
2001
The Max-Shift Algorithm for Approximate String Matching
The approximate string matching problem is to find all locations which a pattern of length m matches a substring of a text of… 
1999
1999
A New Indexing Method for Approximate String Matching
We present a new indexing method for the approximate string matching problem. The method is based on a suffix tree combined with… 
1997
1997
Multiple Approximate String Matching
We present two new algorithms for on-line multiple approximate string matching. These are extensions of previous algorithms that… 
1995
1995
CASM: A VLSI Chip for Approximate String Matching
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… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)