legendary-doc-site/apps/core/assets/node_modules/levenary
2020-07-03 21:41:01 -05:00
..
index.d.ts chore: Convert to umbrella app 2020-07-03 21:41:01 -05:00
index.flow.js chore: Convert to umbrella app 2020-07-03 21:41:01 -05:00
index.js chore: Convert to umbrella app 2020-07-03 21:41:01 -05:00
index.mjs chore: Convert to umbrella app 2020-07-03 21:41:01 -05:00
LICENSE chore: Convert to umbrella app 2020-07-03 21:41:01 -05:00
package.json chore: Convert to umbrella app 2020-07-03 21:41:01 -05:00
README.md chore: Convert to umbrella app 2020-07-03 21:41:01 -05:00

levenary

npm-version github-actions

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

Usage

import levenary from 'levenary';

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

Why levenary?

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

Benchmark

$ npm run bench
  311,915 op/s » levenary
   74,030 op/s » didyoumean
  141,423 op/s » didyoumean2