Implementation of the Levenshtein algorithm used to calculate distince between strings.
Install using npm:
$ npm install --save fast-levenshtein-string
var levenshtein = require('fast-levenshtein-string');
levenshtein.compute('niche', 'chiens'); // 5
Check requirements.
Returns Levensthein distance between rawWord1 and rawWord2.
Required
- rawWord1 must be not
Null
- rawWord1 must be of type
String
- rawWord2 must be not
Null
- rawWord2 must be of type
String
Does NOT check requirements.
Returns Levensthein distance between rawWord1 and rawWord2.
Required
- rawWord1 must be not
Null
- rawWord1 must be of type
String
- rawWord2 must be not
Null
- rawWord2 must be of type
String