npm package discovery and stats viewer.

Discover Tips

  • General search

    [free text search, go nuts!]

  • Package details

    pkg:[package-name]

  • User packages

    @[username]

Sponsor

Optimize Toolset

I’ve always been into building performant and accessible sites, but lately I’ve been taking it extremely seriously. So much so that I’ve been building a tool to help me optimize and monitor the sites that I build to make sure that I’m making an attempt to offer the best experience to those who visit them. If you’re into performant, accessible and SEO friendly sites, you might like it too! You can check it out at Optimize Toolset.

About

Hi, 👋, I’m Ryan Hefner  and I built this site for me, and you! The goal of this site was to provide an easy way for me to check the stats on my npm packages, both for prioritizing issues and updates, and to give me a little kick in the pants to keep up on stuff.

As I was building it, I realized that I was actually using the tool to build the tool, and figured I might as well put this out there and hopefully others will find it to be a fast and useful way to search and browse npm packages as I have.

If you’re interested in other things I’m working on, follow me on Twitter or check out the open source projects I’ve been publishing on GitHub.

I am also working on a Twitter bot for this site to tweet the most popular, newest, random packages from npm. Please follow that account now and it will start sending out packages soon–ish.

Open Software & Tools

This site wouldn’t be possible without the immense generosity and tireless efforts from the people who make contributions to the world and share their work via open source initiatives. Thank you 🙏

© 2024 – Pkg Stats / Ryan Hefner

js-levenshtein-esm

v1.2.0

Published

The most efficient JS implementation calculating the Levenshtein distance, i.e. the difference between two strings.

Downloads

146,447

Readme

Build Status npm version

js-levenshtein-esm

This is a fork of js-levenshtein rewritten for ES module consumption.


A very efficient JS implementation calculating the Levenshtein distance, i.e. the difference between two strings.

Based on Wagner-Fischer dynamic programming algorithm, optimized for speed and memory

  • use a single distance vector instead of a matrix
  • loop unrolling on the outer loop
  • remove common prefixes/postfixes from the calculation
  • minimize the number of comparisons

Install

$ npm i -S js-levenshtein-esm

Usage

In Node:

const levenshtein = require('js-levenshtein-esm');

levenshtein('kitten', 'sitting'); // 3

In the browser:

import levenshtein from 'https://unpkg.com/js-levenshtein-esm/js-levenshtein.js';

levenshtein('kitten', 'sitting'); // 3

Benchmark

$ npm run test:perf

  50 paragraphs, length max=500 min=240 avr=372.5
     62 op/s � fast-levenshtein
    143 op/s � js-levenshtein
    140 op/s � js-levenshtein-esm
     89 op/s � leven
     92 op/s � levenshtein-edit-distance
    100 op/s � talisman

  100 sentences, length max=170 min=6 avr=57.5
    1,304 op/s � fast-levenshtein
    2,829 op/s � js-levenshtein
    2,750 op/s � js-levenshtein-esm
    1,780 op/s � leven
    1,788 op/s � levenshtein-edit-distance
    2,097 op/s � talisman

  2000 words, length max=20 min=3 avr=9.5
    1,952 op/s � fast-levenshtein
    3,104 op/s � js-levenshtein
    2,908 op/s � js-levenshtein-esm
    2,351 op/s � leven
    2,381 op/s � levenshtein-edit-distance
    2,729 op/s � talisman

License

MIT