skip to navigation
skip to content

Not Logged In

FastStringComparator 1.0

Faster Computation of Levenshtein Distance for Spell Checkers

Fast String Comparator is an efficient algorithm for computating Levenshtein distance up to two. Given two strings of length m and n (m <= n), the computation requires O(1) space and O(n) time, which is much smaller and faster than well-known Wagner-Fisher algorithm.

It is mainly targeted at the use in spell checkers, where considering words within two edit distance suffices.

Bug report

Please email to <fujimoto at writingarchives.sakura.ne.jp>

 
File Type Py Version Uploaded on Size
FastStringComparator-1.0.tar.gz (md5) Source 2014-02-06 1KB
  • Downloads (All Versions):
  • 2 downloads in the last day
  • 32 downloads in the last week
  • 190 downloads in the last month