@alordash/damerau-levenshtein

$ npm i @alordash/damerau-levenshtein

Levenshtein algorithm

My realization of Damerau-Levenshtein distance algorithm.

Usage

1const { distance, closest } = require('@alordash/damerau-levenshtein')
2
3// Print Damerau-Levenshtein distance between "better" and "bteetr"
4console.log(distance("better", "bteetr"));
5//=> 2
6
7// Select the most similar string to "park" from string list.
8let value = closest("park", ["luck", "duck", "apkr"]);
9
10// Result:
11console.log(value.closest_string);
12//=> "apkr"
13
14console.log(value.distance);
15//=> 2

Features

You can also create calculation object using DamerauLevenshtein class:

1const { DamerauLevenshtein } = require("@alordash/levenshtein");
2
3// Calculate Damerau-Levenshtein distance between "entity" and "idenitty"
4let object = new DamerauLevenshtein("entity", "idenitty");
5
6// Print Damerau-Levenshtein distance between "entity" and "idenitty"
7console.log(object.valueOf(), object.distance);
8//=> 3 3
9
10// Change strings in object to "first" and "wrist" and calculate Damerau-Levenshtein distance between them
11object.strings = ["first", "wrist"];
12
13// Print Damerau-Levenshtein distance between "first" and "wrist"
14console.log(object.distance);
15//=> 2
16
17// Print calculation matrix
18console.log(object.toString());
19//=>
20//     |   | w | r | i | s | t
21//—————+–––+–––+–––+–––+–––+–––
22//     | 0 | 1 | 2 | 3 | 4 | 5
23//—————+–––+–––+–––+–––+–––+–––
24//   f | 1 | 1 | 2 | 3 | 4 | 5
25//—————+–––+–––+–––+–––+–––+–––
26//   i | 2 | 2 | 2 | 2 | 3 | 4
27//—————+–––+–––+–––+–––+–––+–––
28//   r | 3 | 3 | 2 | 2 | 3 | 4
29//—————+–––+–––+–––+–––+–––+–––
30//   s | 4 | 4 | 3 | 3 | 2 | 3
31//—————+–––+–––+–––+–––+–––+–––
32//   t | 5 | 5 | 4 | 4 | 3 | 2
33//—————+–––+–––+–––+–––+–––+–––