Sign Up
Log In
Log In
or
Sign Up
Places
All Projects
Status Monitor
Collapse sidebar
home:smarty12:Python
python-FastStringComparator
Overview
Repositories
Revisions
Requests
Users
Attributes
Meta
Meta Configuration of Package python-FastStringComparator
<package name="python-FastStringComparator" project="devel:languages:python:misc"> <title/> <description> 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. </description> </package>
Locations
Projects
Search
Status Monitor
Help
OpenBuildService.org
Documentation
API Documentation
Code of Conduct
Contact
Support
@OBShq
Terms
openSUSE Build Service is sponsored by
The Open Build Service is an
openSUSE project
.
Sign Up
Log In
Places
Places
All Projects
Status Monitor
