levenshtein-map
Advanced tools
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.
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.
Please feel free to open issues or PRs if you want to discuss something or improve it.
FAQs
Levenshtein map for best match key value storage
We found that levenshtein-map demonstrated a not healthy version release cadence and project activity because the last version was released a year ago. It has 1 open source maintainer collaborating on the project.
Did you know?
Socket for GitHub automatically highlights issues in each pull request and monitors the health of all your open source dependencies. Discover the contents of your packages and block harmful activity before you install or update your dependencies.
Research
Security News
A threat actor's playbook for exploiting the npm ecosystem was exposed on the dark web, detailing how to build a blockchain-powered botnet.
Security News
NVD’s backlog surpasses 20,000 CVEs as analysis slows and NIST announces new system updates to address ongoing delays.
Security News
Research
A malicious npm package disguised as a WhatsApp client is exploiting authentication flows with a remote kill switch to exfiltrate data and destroy files.