js-levenshtein 43081j · COMPLETED
The most efficient JS implementation calculating the Levenshtein distance, i.e. the difference between two strings.
github.com/43081j/js-levenshtein · ★ 3 · Forks 1 · Size 173 KB
SUMMARY
Technologies 8
Scored 8
Observed 8
Practices 6
Evidence 9
Skips 0
COVERAGE
Analyzed 19 files · 40 commits · 0 API calls
TECHNOLOGIES & DEPTH
TypeScript LANGUAGE Depth 70
1 files · PRODUCTION
JSON LANGUAGE Depth 70
3 files · PRODUCTION
Markdown LANGUAGE Depth 70
1 files · PRODUCTION
YAML LANGUAGE Depth 70
3 files · PRODUCTION
JavaScript LANGUAGE Depth 70
7 files · PRODUCTION
npm BUILD_TOOL Depth 80
1 files · CONFIGURATION
ESLint QUALITY Depth 65
2 files · CONFIGURATION
Prettier QUALITY Depth 65
2 files · CONFIGURATION
PRACTICES
documentation · observedautomated_tests · absentcontinuous_integration · observedcontainerization · absentlinting · observedformatting · observed
ACTIVITY & OWNERSHIP
First commit 2017-05-14
Last commit 2025-03-18
Active months 11
Commits 40