A practical index for approximate dictionary matching with few mismatches

20 Jan 2015 Aleksander Cisłak Szymon Grabowski

Approximate dictionary matching is a classic string matching problem (checking if a query string occurs in a collection of strings) with applications in, e.g., spellchecking, online catalogs, geolocation, and web searchers. We present a surprisingly simple solution called a split index, which is based on the Dirichlet principle, for matching a keyword with few mismatches, and experimentally show that it offers competitive space-time tradeoffs... (read more)

PDF Abstract

Categories


  • DATA STRUCTURES AND ALGORITHMS
  • 68W32
  • H.3.3