leven
Version:
Measure the difference between two strings using the Levenshtein distance algorithm
60 lines (59 loc) • 1.17 kB
JSON
{
"name": "leven",
"version": "4.0.0",
"description": "Measure the difference between two strings using the Levenshtein distance algorithm",
"license": "MIT",
"repository": "sindresorhus/leven",
"funding": "https://github.com/sponsors/sindresorhus",
"author": {
"name": "Sindre Sorhus",
"email": "sindresorhus@gmail.com",
"url": "https://sindresorhus.com"
},
"type": "module",
"exports": "./index.js",
"engines": {
"node": "^12.20.0 || ^14.13.1 || >=16.0.0"
},
"scripts": {
"test": "xo && ava && tsd",
"bench": "matcha bench.js"
},
"files": [
"index.js",
"index.d.ts"
],
"keywords": [
"leven",
"levenshtein",
"distance",
"algorithm",
"string",
"difference",
"diff",
"fast",
"fuzzy",
"similar",
"similarity",
"compare",
"comparison",
"edit",
"text",
"match",
"matching"
],
"devDependencies": {
"ava": "^3.15.0",
"fast-levenshtein": "^3.0.0",
"ld": "^0.1.0",
"levdist": "^2.2.10",
"levenshtein": "^1.0.5",
"levenshtein-component": "^0.0.1",
"levenshtein-edit-distance": "^3.0.0",
"matcha": "^0.7.0",
"natural": "^5.0.4",
"talisman": "^1.1.4",
"tsd": "^0.17.0",
"xo": "^0.44.0"
}
}