Skip to content

Deno module to compute the Levenshtein distance between two strings

License

Notifications You must be signed in to change notification settings

aosync/levenshtein

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

5 Commits
 
 
 
 
 
 
 
 

Repository files navigation

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"); // 3

About

Deno module to compute the Levenshtein distance between two strings

Resources

License

Stars

Watchers

Forks

Packages

No packages published