fastest-levenshtein
Advanced tools
Comparing version 1.0.3 to 1.0.4
{ | ||
"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) |
10403