[](https://www.npmjs.com/package/levenary) [](https://github.com/tanhauhau/levenary/actions)
npm install levenary
> Given a string, A and an array of strings XS, return the string X from XS whose Levenshtein distance from A is minimal.
``
$ npm install levenary
`js
import levenary from 'levenary';
levenary('cat', ['cow', 'dog', 'pig']);
//=> 'cow'
`
?`
$ npm run bench
`
311,915 op/s » levenary
74,030 op/s » didyoumean
141,423 op/s » didyoumean2