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.

2014

In this paper, we explore approaches to parallelizing the edit distance problem and the related approximate string matching…

2012

Approximate string matching using the k-mismatch technique has been widely applied to many fields such as virus detection and…

2011

, r ≥1, in the given text T[0…n-1], allowing limited number of errors in the matches. This problem has many applications in…

2009

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

2008

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

2007

A compressed full-text self-index for a text T is a data structure requiring reduced space and able of searching for patterns P…

2005

This paper presents a design and implementation of a reconfigurable parallel approximate string matching hardware on FPGAs. The…

2004

Approximate string matching technique has been widely applied to many fields such as network information retrieval, digital…

2004

Approximate string matching with k differences is considered. Filtration of the text is a widely adopted technique to reduce the…

2002

Translation is a repetitive activity. The attempt to automate such a difficult task has been a long-term scientific dream; in the…