node-levenshtein
Advanced tools
Comparing version 1.0.8 to 1.0.9
{ | ||
"name": "node-levenshtein", | ||
"version": "1.0.8", | ||
"version": "1.0.9", | ||
"description": "Fastest Levenshtein distance implementation.", | ||
@@ -21,2 +21,3 @@ "main": "./js/node-levenshtein.js", | ||
"algorithm", | ||
"match", | ||
"addon", | ||
@@ -28,3 +29,2 @@ "comparison", | ||
"matching", | ||
"match", | ||
"similar", | ||
@@ -41,3 +41,6 @@ "node", | ||
"homepage": "https://github.com/ka-weihe/node-levenshtein#readme", | ||
"dependencies": {} | ||
"dependencies": {}, | ||
"engines": { | ||
"node": ">=8.6.0" | ||
} | ||
} |
# node-levenshtein :rocket: | ||
Fastest implementation of the [Levenshtein distance](https://en.wikipedia.org/wiki/Levenshtein_distance) algorithm - (approx. 60+ percent faster than the 2nd fastest implementation). This algorithm can be used to measure the similarity of two strings. | ||
node-levenshtein requires __node v8.6.0__ or higher. | ||
## Install | ||
@@ -5,0 +6,0 @@ ``` |
License Policy Violation
LicenseThis package is not allowed per your license policy. Review the package's license to ensure compliance.
Found 1 instance in 1 package
License Policy Violation
LicenseThis package is not allowed per your license policy. Review the package's license to ensure compliance.
Found 1 instance in 1 package
7521078
48