Implementation 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-
Notifications
You must be signed in to change notification settings - Fork 0
Deno module to compute the Levenshtein distance between two strings
License
aosync/levenshtein
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Deno module to compute the Levenshtein distance between two strings
Resources
License
Stars
Watchers
Forks
Packages 0
No packages published