Skip to content

Levenshtein map using the closest editing distance algorithm

Notifications You must be signed in to change notification settings

dgonzalez/levenshtein-map

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

2 Commits
 
 
 
 
 
 
 
 
 
 

Repository files navigation

levenshtein-map

Levenshtein map is a collection that allows you to create a 'best match' storage class. It uses the Levenshtein distance algorithm to calculate what is the best fit.

How to use it

As simple as it sounds:

let map = new LevenshteinMap()
map.put('bananas', 'test')
map.put('emmm', 'bananas!')

map.get('banan') // It will return 'test'
map.get('emm') // it will return 'bananas!'

Exact matches will have precedence over Levenshtein algorithm.

Contribute

Please feel free to open issues or PRs if you want to discuss something or improve it.

About

Levenshtein map using the closest editing distance algorithm

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published