Metadata-Version: 1.1
Name: TinyFastSS
Version: 1.0
Summary: Efficient Data Structure for Fuzzy String Search
Home-page: http://writingarchives.sakura.ne.jp/tinyfss/index.html
Author: Seiji Fujimoto
Author-email: fujimoto.report@gmail.com
License: UNKNOWN
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
        =============
        
        http://writingarchives.sakura.ne.jp/tinyfss/index.html
        
        Bug report
        ==========
        
        Please email to <fujimoto.report at gmail.com>
        
Platform: UNKNOWN
Classifier: Programming Language :: Python
Classifier: Development Status :: 4 - Beta
Classifier: Intended Audience :: Science/Research
Classifier: License :: OSI Approved :: MIT License
Classifier: Operating System :: OS Independent
Classifier: Programming Language :: Python :: 2
Classifier: Programming Language :: Python :: 3
Classifier: Topic :: Scientific/Engineering
Classifier: Topic :: Text Processing
