1.0.14 • Published 4 years ago

@haggholm/damerau-levenshtein v1.0.14

Weekly downloads
112
License
MIT
Repository
github
Last release
4 years ago

Damerau-Levenshtein distance

A direct port of the Levenshtein/Damerau-Levenshtein algorithm from natural to an N-API/C++ extension.

In the browser, it will use the implementation copied from natural, with the addition of an offset parameter in search results.

In NodeJS, it uses the N-API implementation. In tests on production data on our workload, it is ~15x faster than the original JS; on smaller strings as used in the automated tests, the speedup is ~27x.

Correctness is based on the assumption that natural is correct. :-) Compliance is currently verified by running distance checks on several thousand random sample strings and verifying that the N-API generates identical results.

1.0.14

4 years ago

1.0.8

4 years ago

1.0.7

4 years ago

1.0.6

4 years ago

1.0.5

4 years ago

1.0.4

4 years ago

1.0.3

4 years ago

1.0.2

4 years ago

1.0.1

4 years ago

1.0.0

4 years ago