</>PackageGraphPackageGraph

fastest-levenshtein

npmv1.0.16TypeScript

Fastest Levenshtein distance implementation in JS.

Not recommended for new projects

No — fastest-levenshtein should not be adopted for new projects. Last published 1499 days ago.

  • ?Adoption: grade ?, Not reported by this registry.

    No download data reported for this package yet.

  • FMaintenance: grade F, Failing.

    Last published 1499 days ago.

  • AWeight: grade A, Excellent.

    Zero runtime dependencies, about 21 KB installed.

  • BSupply chain: grade B, Good.

    This package has a single maintainer (bus factor of 1).

  • ALicense: grade A, Excellent.

    MIT — permissive, with no copyleft found in the dependency tree.

Grades are computed deterministically from registry metadata collected by PackageGraph — downloads, dependents, publish dates, the resolved dependency tree, maintainer count, and declared licenses. No third-party scores are used.

Install cost

What you actually take on by adding fastest-levenshtein to a project.

0
Direct dependencies

Runtime packages this one declares itself.

0
Total installed

Distinct packages in the full runtime tree, deduplicated the way a package manager would.

21 KB
Install size

Unpacked size of this package plus its entire runtime tree.

—
Tree depth

Longest resolved dependency chain below this package.

Compatibility

Node.js
node >= 4.9.1
Module format
ESM + CommonJS
TypeScript
Types included
Install scripts
None

Quick start

A usage example from the fastest-levenshtein README.

javascriptFull README ↗
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'

fastest-levenshtein vs the alternatives

Packages solving a similar problem in the npm ecosystem, compared on the signals that drive an adoption decision.

PackageWeekly downloadsDependentsLicenseLast release
fastest-levenshteinthis page01MIT4 years ago
leven02MIT1 day ago
fast-levenshtein03MIT1 day ago
p-locate216.9M1MIT1 day ago
is-glob137.4M3MIT1 day ago
sql-escaper5M1MIT1 day ago

Dependencies

Declared by fastest-levenshtein v1.0.16. Runtime dependencies are installed with the package; dev dependencies are not.

Dev (21)

@types/benchmark ^1.0.33@types/jest ^26.0.15@typescript-eslint/eslint-plugin ^4.7.0@typescript-eslint/parser ^4.7.0benchmark ^2.1.4coveralls ^3.1.0eslint ^7.13.0eslint-config-node ^4.1.0eslint-config-prettier ^6.15.0eslint-plugin-import ^2.22.1eslint-plugin-node ^11.1.0eslint-plugin-prettier ^3.1.4fast-levenshtein ^2.0.6jest ^26.6.3js-levenshtein ^1.1.6leven ^3.1.0levenshtein-edit-distance ^2.0.5natural ^2.1.5prettier ^2.1.2talisman ^1.1.3typescript ^4.0.5

Used by

Popular packages that depend on fastest-levenshtein.

fast-levenshteinnpm

Efficient implementation of Levenshtein algorithm with locale-specific collator support.

↓ 0/wk◈ 3 dependents⚖ MIT

Relationship graph

Dependencies (left) and dependents (right) of fastest-levenshtein.

fast-levenshteinfastest-levenshte…
fastest-levenshtein dependencies dependents

Frequently installed together

lodashnpm

Lodash modular utilities.

↓ 147.8M/wk◈ 20 dependents⚖ MIT
chainpm

BDD/TDD assertion library for node.js and the browser. Test framework agnostic.

↓ 0/wk◈ 57 dependents⚖ MIT

Release history

No releases in the last two years, typically about 0 days apart.

Recent versions of fastest-levenshtein
VersionPublishedSizeLicense
1.0.16latest4 years ago21 KBMIT
1.0.154 years ago21 KBMIT
1.0.144 years ago17 KBMIT
1.0.134 years ago17 KBMIT
1.0.126 years ago11 KBMIT
1.0.116 years ago16 KBMIT
1.0.106 years ago14 KBMIT
1.0.96 years ago11 KBMIT
1.0.86 years ago10 KBMIT
1.0.76 years ago10 KBMIT
1.0.66 years ago10 KBMIT
1.0.56 years ago10 KBMIT
1.0.46 years ago10 KBMIT
1.0.36 years ago10 KBMIT
1.0.26 years ago13 KBMIT

Overview

fastest-levenshtein is an npm package that fastest Levenshtein distance implementation in JS. It has 1 known dependents in the graph. The latest version is 1.0.16, released under the MIT license.

Who should use it

Teams working in the npm ecosystem who need fastest Levenshtein distance implementation in JS and value a focused solution.

When not to use it

Consider an alternative if you need to minimize your dependency tree, or if a more actively-maintained option better fits your npm stack.

Pros

  • Ships TypeScript type definitions.
  • Clear open-source license (MIT).

Cons

  • Large dependency tree (21 direct dependencies) increases install size and audit surface.

Auto-generated from collected registry metadata. No external claims are inferred.

Maintainers

ka-weihe

Keywords

algorithmcomparisondifferencedistanceeditfastfastestfuzzylevenshteinmatchmatchingnodesearchsimilarsimilaritystring

Frequently asked questions

Should I use fastest-levenshtein?

No — fastest-levenshtein should not be adopted for new projects. Last published 1499 days ago.

How do I install fastest-levenshtein?

Run `npm install fastest-levenshtein` to add fastest-levenshtein to your npm project.

What license is fastest-levenshtein released under?

fastest-levenshtein is distributed under the MIT license.

How popular is fastest-levenshtein?

npm does not publish download counts. Within PackageGraph's crawl, 1 known packages depend on fastest-levenshtein.

Is fastest-levenshtein still maintained?

The most recent release of fastest-levenshtein (v1.0.16) was published 4 years ago.

Does fastest-levenshtein run install scripts?

No. fastest-levenshtein does not define preinstall, install, or postinstall scripts, so installing it does not execute publisher-supplied code.