NPM package that calculates synchronously or asynchronously the Damerau-Levenshtein distance between strings.

npm i damerau-levenshtein-js

Call to "distance" or "distanceProm" functions outputs an integer, the calculated Damerau-Levenshtein distance between 2 strings given as parameters. If the result is 0, strings are identical. The higher the result, the less similar strings are. If the result is -1, it means that a problem occurred because of a bad parameter (e.g. null or undefined). Call to "minDistanceProm" function outputs the minimum distance between a string and a list of strings given as parameters.

const dljs = require("damerau-levenshtein-js");

let result = dljs.distance("hello here", "hello there");

dljs.distanceProm("hello here", "hello there")
        .then((result) => ...)
        .catch((result) => ...);

let list = ["hello here", "hello there", "world", "world hello"];
dljs.minDistanceProm("hello world", list)
        .then((result) => ...)
        .catch((result) => ...);

npm test

I am not responsible in any way of any consequence of the usage of this piece of software. You are warned, use it at your own risks.