book chapter · Society for Industrial and Applied Mathematics eBooks · 2007

Faster Filters for Approximate String Matching

Cited by 27Abstract and details only

Abstract

We introduce a new filtering method for approximate string matching called the suffix filter. It has some similarity with well-known filtration algorithms, which we call factor filters, and which are among the best practical algorithms for approximate string matching using a text index. Suffix filters are stronger, i.e., produce fewer false matches than factor filters. We demonstrate experimentally that suffix filters are faster in practice, too.

Cite this paper

APA 7

Kärkkäinen, J., & Na, J. C. (2007). Faster Filters for Approximate String Matching. Society for Industrial and Applied Mathematics eBooks, 84–90. https://doi.org/10.1137/1.9781611972870.8

MLA 9

Kärkkäinen, Juha, and Joong Chae Na. “Faster Filters for Approximate String Matching.” Society for Industrial and Applied Mathematics eBooks, 2007, pp. 84–90, https://doi.org/10.1137/1.9781611972870.8.

Chicago

Kärkkäinen, Juha, and Joong Chae Na. 2007. “Faster Filters for Approximate String Matching.” Society for Industrial and Applied Mathematics eBooks: 84–90. https://doi.org/10.1137/1.9781611972870.8.

Harvard

Kärkkäinen, J. and Na, J.C. (2007) ‘Faster Filters for Approximate String Matching’, Society for Industrial and Applied Mathematics eBooks, pp. 84–90. Available at: https://doi.org/10.1137/1.9781611972870.8.

BibTeX

@incollection{karkkainen2007faster,
  title = {{Faster Filters for Approximate String Matching}},
  author = {Kärkkäinen, Juha and Na, Joong Chae},
  booktitle = {Society for Industrial and Applied Mathematics eBooks},
  pages = {84--90},
  year = {2007},
  doi = {10.1137/1.9781611972870.8}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.