Metadata-Version: 1.1
Name: FastStringComparator
Version: 1.0
Summary: Faster Computation of Levenshtein Distance for Spell Checkers
Home-page: http://writingarchives.sakura.ne.jp/fastcomp/index.html
Author: Seiji Fujimoto
Author-email: fujimoto@writingarchives.sakura.ne.jp
License: UNKNOWN
Description: 
        Fast String Comparator is an efficient algorithm for computating Levenshtein distance up to *two*. Given two strings of length m and n (m &lt;= n), the computation requires O(1) space and O(n) time, which is much smaller and faster than Wagner-Fisher algorithm.
        
        It is mainly targeted at the use in spell checkers, where considering words within two edit distance suffices. 
        
        Documentation
        =============
        
        http://writingarchives.sakura.ne.jp/fastcomp/index.html
        
        Demo
        ====
        
        http://writingarchives.sakura.ne.jp/fastcomp/demo/index.html
        
        Bug report
        ==========
        
        Please email to <fujimoto at writingarchives.sakura.ne.jp>
        
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
