@zitro/edit-distance
v1.0.1npm· JavaScriptA tiny optimized package which finds the Levenshtein distance (edit distance) between two words. Having two strings of length N and M, the algorithm has O(N*M) complexity and uses O(N) additional space.
The verdict
Abandoned. Last published 8 years ago. No recent activity — look for a maintained alternative.
No recent activity — look for a maintained alternative.
Live from the npm registry · derived rules, not AI
How it scores
MaintenanceAbandoned
PopularityUnknown
SecurityClean
LicensePermissive
DepsZero deps
Maintenance
Last published 8 years ago.
Popularity
Download count unavailable.
Security
No known advisories for this version (OSV).
License
MIT
Dependencies
No runtime dependencies
Recent releases
- 1.0.18 years ago
- 1.0.08 years ago