Socket
Socket
Sign inDemoInstall

fastest-levenshtein

Package Overview
Dependencies
1
Maintainers
1
Versions
17
Alerts
File Explorer

Advanced tools

Install Socket

Detect and block malicious and high-risk dependencies

Install

Comparing version 1.0.3 to 1.0.4

2

package.json
{
"name": "fastest-levenshtein",
"version": "1.0.3",
"version": "1.0.4",
"description": "Fastest Levenshtein distance implementation in JS.",

@@ -5,0 +5,0 @@ "main": "index.js",

@@ -27,3 +27,3 @@ # fastest-levenshtein :rocket:

## 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. fastest-levenshtein is a lot faster in all cases.
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. `fastest-levenshtein` is a lot faster in all cases.

@@ -39,3 +39,3 @@ | Test Target | N=4 | N=8 | N=16 | N=32 | N=64 | N=128 | N=256 | N=512 | N=1024 |

### Relative Performance
This image shows the relative performance between fastest-levenshtein and js-levenshtein (the 2nd fastest). As you can see, fastest-levenshtein is always a lot faster.
This image shows the relative performance between `fastest-levenshtein` and `js-levenshtein` (the 2nd fastest). `fastest-levenshtein` is always a lot faster.

@@ -42,0 +42,0 @@ ![Benchmark](/images/relaperf.png)

SocketSocket SOC 2 Logo

Product

  • Package Alerts
  • Integrations
  • Docs
  • Pricing
  • FAQ
  • Roadmap

Stay in touch

Get open source security insights delivered straight into your inbox.


  • Terms
  • Privacy
  • Security

Made with ⚡️ by Socket Inc