Efficient Data Structure for Fuzzy String Search
Project description
Abstract
FastSS is an extremely efficient data structure for approximate string search, invented by researchers at Zurich University. Given a set of words, it allows exhaustive retrieval of entries whose edit distance to query string is equal to or less than k. The amount of time it requires to lookup is quite smaller than any other approaches. For more details about FastSS, visit the official website at <http://fastss.csg.uzh.ch/>.
TinyFastSS is a simple Python implementation of FastSSwC (variant of FastSS) with fixed bound k=2 , written in less than 80 lines.
Documentation
Bug report
Please email to <fujimoto.report at gmail.com>