Analyzed
about 3 years
ago.
based on code collected
over 3 years
ago.
Project Summary
This is my alternative to the Levenstein string distance algorithm. By looking for similarity locally, I made it really fast! Complexity O(n*constant) rather than O(n^2)
In a Nutshell, Sift String Distance and Similarity a...
MIT License
Permitted
Commercial Use
Modify
Distribute
Sub-License
Private Use
Forbidden
Hold Liable
Required
Include Copyright
Include License
These details are provided for information only. No information here is legal advice and should not be used as such.
This Project has No vulnerabilities Reported Against it
Did You Know...
-
...
in 2016, 47% of companies did not have formal process in place to track OS code
-
...
anyone with an Open Hub account can update a project's tags
-
...
65% of companies leverage OSS to speed application development in 2016
-
...
compare projects before you chose one to use
