levenshtein
Implementation of the Wagner-Fischer algorithm to compute the Levenshtein distance between two strings.
Usage
import levenshtein from "https://deno.land/x/levenshtein/mod.ts";
levenshtein("kitten", "sitting"); // 3Implementation of the Wagner-Fischer algorithm to compute the Levenshtein distance between two strings.
import levenshtein from "https://deno.land/x/levenshtein/mod.ts";
levenshtein("kitten", "sitting"); // 3