fastest-levenshtein

WebJar for fastest-levenshtein

License	MIT
GroupId	org.webjars.npm
ArtifactId	fastest-levenshtein
Last Version	1.0.12
Release Date	Jan 3, 2021
Type	jar
Description	fastest-levenshtein WebJar for fastest-levenshtein
Project URL	https://www.webjars.org
Source Code Management	https://github.com/ka-weihe/fastest-levenshtein

Download fastest-levenshtein

Filename	Size
fastest-levenshtein-1.0.12.pom
fastest-levenshtein-1.0.12.jar	7 KB
fastest-levenshtein-1.0.12-sources.jar	22 bytes
fastest-levenshtein-1.0.12-javadoc.jar	22 bytes

How to add to project

Apache Maven

<!-- https://jarcasting.com/artifacts/org.webjars.npm/fastest-levenshtein/ -->
<dependency>
    <groupId>org.webjars.npm</groupId>
    <artifactId>fastest-levenshtein</artifactId>
    <version>1.0.12</version>
</dependency>

Gradle Groovy

// https://jarcasting.com/artifacts/org.webjars.npm/fastest-levenshtein/
implementation 'org.webjars.npm:fastest-levenshtein:1.0.12'

Gradle Kotlin

// https://jarcasting.com/artifacts/org.webjars.npm/fastest-levenshtein/
implementation ("org.webjars.npm:fastest-levenshtein:1.0.12")

Apache Buildr

'org.webjars.npm:fastest-levenshtein:jar:1.0.12'

Apache Ivy

<dependency org="org.webjars.npm" name="fastest-levenshtein" rev="1.0.12">
  <artifact name="fastest-levenshtein" type="jar" />
</dependency>

Groovy Grape

@Grapes(
@Grab(group='org.webjars.npm', module='fastest-levenshtein', version='1.0.12')
)

Scala SBT

libraryDependencies += "org.webjars.npm" % "fastest-levenshtein" % "1.0.12"

Leiningen

[org.webjars.npm/fastest-levenshtein "1.0.12"]

Dependencies

There are no dependencies for this project. It is a standalone project that does not depend on any other jars.

Project Modules

There are no modules declared in this project.

fastest-levenshtein 🚀

Fastest JS/TS implemenation of Levenshtein distance.
Measure the difference between two strings.

$ npm i fastest-levenshtein

Usage

Node

const {distance, closest} = require('fastest-levenshtein')

// Print levenshtein-distance between 'fast' and 'faster' 
console.log(distance('fast', 'faster'))
//=> 2

// Print string from array with lowest edit-distance to 'fast'
console.log(closest('fast', ['slow', 'faster', 'fastest']))
//=> 'faster'

Deno

import {distance, closest} from 'https://deno.land/x/fastest_levenshtein/mod.ts'

// Print levenshtein-distance between 'fast' and 'faster' 
console.log(distance('fast', 'faster'))
//=> 2

// Print string from array with lowest edit-distance to 'fast'
console.log(closest('fast', ['slow', 'faster', 'fastest']))
//=> 'faster'

Benchmark

I generated 500 pairs of strings with length N. I measured the ops/sec each library achieves to process all the given pairs. Higher is better.

Test Target	N=4	N=8	N=16	N=32	N=64	N=128	N=256	N=512	N=1024
fastest-levenshtein	44423	23702	10764	4595	1049	291.5	86.64	22.24	5.473
js-levenshtein	21261	10030	2939	824	223	57.62	14.77	3.717	0.934
leven	19688	6884	1606	436	117	30.34	7.604	1.929	0.478
fast-levenshtein	18577	6112	1265	345	89.41	22.70	5.676	1.428	0.348
levenshtein-edit-distance	22968	7445	1493	409	109	28.07	7.095	1.789	0.445

Relative Performance

This image shows the relative performance between fastest-levenshtein and js-levenshtein (the 2nd fastest). fastest-levenshtein is always a lot faster. y-axis shows "times faster".

License

This project is licensed under the MIT License - see the LICENSE.md file for details

Versions

Version
1.0.12 Jan 3, 2021