Package Health/designbycode/levenshtein-distance
designbycode/levenshtein-distance
The LevenshteinDistance class provides a method to calculate the Levenshtein distance between two strings. The Levenshtein distance is a measure of the minimum number of single-character edits (insertions, deletions, or substitutions) required to change one word into the other.
79%
Total Score
Maintainer Stability
Maintainer Stability
Assesses the consistency and reliability of package maintainers
44
Dependencies
Dependencies
Evaluates the health and security of package dependencies
100
Maturity
Maturity
Indicates package age, release frequency, and adoption metrics
81
Supply Chain
Supply Chain
Evaluates supply chain security practices and risks
100
Vulnerabilities
We didn't find any vulnerabilities for this package.
Package versions
Maintainers
 Claude Myburgh |
Direct Dependencies
No direct dependencies.
Weekly Downloads
Info
- Last Published
- 1 year ago
- Created
- 1 year ago
Are You Affected?
Connect your repositories to instantly see whether vulnerable or malicious packages exist in your codebase.
Free. No credit card required.
Resources
Industries
Use Cases
Compare
Subscribe
Stay up to date with all updates
I consent to receiving marketing communications based on Aikido’s Privacy Policy.
© 2026 Aikido Security BV | BE0792914919
Keizer Karelstraat 15, 9000, Ghent, Belgium
95 Third St, 2nd Fl, San Francisco, CA 94103, US
Unit 6.15 Runway East 18 18 Crucifix Ln, London SE1 3JW UK
Ghent, Belgium | San Francisco, US
SOC 2Compliant
ISO 27001Compliant