Faster Filters for Approximate String Matching
Juha Kärkkäinen, Joong Chae Na · Society for Industrial and Applied Mathematics eBooks · 2007
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.