levenary

[![npm-version](https://img.shields.io/npm/v/levenary.svg)](https://www.npmjs.com/package/levenary) [![github-actions](https://github.com/tanhauhau/levenary/workflows/CI/badge.svg)](https://github.com/tanhauhau/levenary/actions)

MIT 5 个版本
leven levenshtein distance array string algorithm algo string difference diff fast fuzzy similar similarity compare comparison edit text match matching
仓库
安装
npm install levenary
yarn add levenary
pnpm add levenary
bun add levenary
README

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
版本列表
1.1.1 2020-01-28
1.1.0 2019-12-25
1.0.2 2019-12-19
1.0.1 2019-12-19
1.0.0 2019-12-19