ISOVIS
/
StackGenVis
9
0
Fork 0
Code Issues Pull Requests Releases 2 Wiki Activity
StackGenVis: Alignment of Data, Algorithms, and Models for Stacking Ensemble Learning Using Performance Metrics https://doi.org/10.1109/TVCG.2020.3030352
You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
75 Commits
1 Branch
2 Tags
1.9 GiB
 
 
 
 
Tag: Branch: Tree: e069030893
Branches Tags
${ item.name }
Create tag ${ searchTerm }
Create branch ${ searchTerm }
from 'e069030893'
${ noResults }
StackGenVis/frontend/node_modules/levenary
History
Angelos Chatzimparmpas e069030893
fix the frontend 		3 years ago
..
LICENSE fix the frontend 3 years ago
README.md fix the frontend 3 years ago
index.d.ts fix the frontend 3 years ago
index.flow.js fix the frontend 3 years ago
index.js fix the frontend 3 years ago
index.mjs fix the frontend 3 years ago
package.json fix the frontend 3 years ago

README.md

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