Efficient Merging and Filtering Algorithms for Approximate String Searches

By Jiaheng Lu, Yiming Lu. IEEE International Conference on Data Engineering, 2008

314 citations recorded by the source corpus.

We study the following problem: how to efficiently find in a collection of strings those similar to a given query string? Various similarity functions can be used, such as edit distance, Jaccard similarity, and cosine similarity. This problem is of great interests to a variety of applications that need a high real-time performance, such as data cleaning, query relaxation, and spellchecking. Several algorithms have been proposed based on the idea of merging inverted lists of grams generated from the strings. In this paper we make two contributions. First, we develop several algorithms that can greatly improve the performance of existing algorithms. Second, we study how to integrate existing filtering techniques with these algorithms, and show that they should be used together judiciously, since the way to do the integration can greatly affect the performance. We have conducted experiments on several real data sets to evaluate the proposed techniques.

Subfields: Information Systems, Management Science and Operations Research, Signal Processing

View Paper: https://www.semanticscholar.org/paper/3b2616ec17a71453c11f06e1cc38f9034d23c74f

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Information Systems

  1. Kui Ren
  2. Wenjing Lou
  3. Ning Cao
  4. Qian Wang
  5. Jin Li
  6. Cong Wang
  7. Eric Nyberg
  8. Bilegsaikhan Naidan

In Management Science and Operations Research

  1. Eric Nyberg
  2. Wenjing Lou
  3. Bilegsaikhan Naidan
  4. Leonid Boytsov

In Signal Processing

  1. Kui Ren
  2. Eric Nyberg
  3. Bilegsaikhan Naidan
  4. Leonid Boytsov
  5. Dmitry A. Yashunin
  6. Tom Drummond
  7. Ben Harwood
  8. Yury Malkov

Citations in the corpus