levenary@1.0.2
> Given a string, A and an array of strings XS, return the string X from XS whose Levenshtein distance from A is minimal.
MIT
2019-12-19
安装 (1.0.2)
npm install levenary@1.0.2yarn add levenary@1.0.2pnpm add levenary@1.0.2bun add levenary@1.0.2dependencies (1)
| 包名 | 版本要求 |
|---|---|
| leven | ^3.1.0 |
devDependencies (9)
| 包名 | 版本要求 |
|---|---|
| @babel/cli | ^7.7.5 |
| @babel/core | ^7.7.5 |
| @babel/preset-env | ^7.7.6 |
| babel-jest | ^24.9.0 |
| bench | ^0.3.6 |
| didyoumean | ^1.2.1 |
| didyoumean2 | ^3.1.2 |
| jest | ^24.9.0 |
| matcha | ^0.7.0 |