Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 238,207,414 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
33 relations
Acoustic fingerprint
BK-tree
Bitap algorithm
Computer science
Expand
Broader (2)
Dynamic programming
Pattern matching
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
Parallel Algorithm for Approximate String Matching with K Differences
Longjiang Guo
,
Shufang Du
,
+5 authors
Keqin Li
IEEE Eighth International Conference on…
2013
Corpus ID: 12099413
Approximate string matching using the k-difference technique has been widely applied to many fields such as pattern recognition…
Expand
2011
2011
Efficient bit-parallel multi-patterns approximate string matching algorithms
R. Prasad
,
Anuj Sharma
,
Alok Singh
,
S. Agarwal
,
Sanjay Misra
2011
Corpus ID: 18752040
, r ≥1, in the given text T[0…n-1], allowing limited number of errors in the matches. This problem has many applications in…
Expand
2009
2009
Fast Convolutions and Their Applications in Approximate String Matching
K. Fredriksson
,
S. Grabowski
International Workshop on Combinatorial…
2009
Corpus ID: 12710740
We develop a method for performing boolean convolutions efficiently in word RAM model of computation, having a word size of $w…
Expand
2009
2009
Morphological Problems in IR and CLIR. Applying linguistic methods and approximate string matching tools
Eija Airio
2009
Corpus ID: 47773567
The UTACLIR system of University of Tampere uses a dictionary-based CLIR approach. The idea of UTACLIR is to recognize distinct…
Expand
2008
2008
Efficient FPGA-based Hardware Algorithms for Approximate String Matching
S. Mikami
,
Yosuke Kawanaka
,
S. Wakabayashi
,
Shinobu Nagayama
2008
Corpus ID: 61904962
In this paper, an efficient FPGA-based hardware algorithm and its extensions are proposed for calculating the edit distance as a…
Expand
2005
2005
Reconfigurable parallel approximate string matching on FPGAs
J. Park
Euromicro Symposium on Digital Systems Design
2005
Corpus ID: 14322305
This paper presents a design and implementation of a reconfigurable parallel approximate string matching hardware on FPGAs. The…
Expand
2004
2004
Parallel Algorithms for Approximate String Matching on PRAM and LARPBS
Zhong Cheng
,
Guo-Liang Chen
2004
Corpus ID: 18370901
Approximate string matching technique has been widely applied to many fields such as network information retrieval, digital…
Expand
2004
2004
Approximate String Matching with Ordered q-Grams
E. Sutinen
,
J. Tarhio
Nordic Journal of Computing
2004
Corpus ID: 12249826
Approximate string matching with k differences is considered. Filtration of the text is a widely adopted technique to reduce the…
Expand
2002
2002
Searching Similar (Sub)Sentences for Example-Based Machine Translation
F. Mandreoli
,
R. Martoglia
,
P. Tiberio
Sistemi Evoluti per Basi di Dati
2002
Corpus ID: 6644569
Translation is a repetitive activity. The attempt to automate such a difficult task has been a long-term scientific dream; in the…
Expand
2001
2001
Document filtering for fast approximate string matching of erroneous text
A. Takasu
Proceedings of Sixth International Conference on…
2001
Corpus ID: 46134719
It is important to utilize retrospective documents. OCR is the most widely applied technology for this purpose; however, error…
Expand