rpm-mcarman b9f7ec4306 First Commit		pirms 3 gadiem
..
LICENSE	First Commit	pirms 3 gadiem
README.md	First Commit	pirms 3 gadiem
index.d.ts	First Commit	pirms 3 gadiem
index.flow.js	First Commit	pirms 3 gadiem
index.js	First Commit	pirms 3 gadiem
index.mjs	First Commit	pirms 3 gadiem
package.json	First Commit	pirms 3 gadiem

levenary

Given a string, A and an array of strings XS, return the string X from XS whose Levenshtein distance from A is minimal.

Install

$ npm install levenary

import levenary from 'levenary';

levenary('cat', ['cow', 'dog', 'pig']);
//=> 'cow'

Based on leven, the fastest JS implementation of the Levenshtein distance algorithm
Only 1 API. Simple and clean. If you want more, please use didyoumean2.
Flow and TypeScript support.

$ npm run bench

  311,915 op/s » levenary
   74,030 op/s » didyoumean
  141,423 op/s » didyoumean2