Binary package “node-fast-levenshtein” in ubuntu noble
efficient implementation of Levenshtein algorithm
In information theory, linguistics, and computer science, the
Levenshtein distance is a string metric for measuring the difference
between two sequences.
Informally, the Levenshtein distance between two words is the
minimum number of single-character edits (insertions,
deletions or substitutions) required to change one word into the other.
.
This is pure JavaScript implementation for Node.js.
.
Node.js is an event-based server-side JavaScript engine.
Source package
Published versions
- node-fast-levenshtein 2.0.6+ds-3 in amd64 (Release)
- node-fast-levenshtein 2.0.6+ds-3 in arm64 (Release)
- node-fast-levenshtein 2.0.6+ds-3 in armhf (Release)
- node-fast-levenshtein 2.0.6+ds-3 in i386 (Release)
- node-fast-levenshtein 2.0.6+ds-3 in ppc64el (Release)
- node-fast-levenshtein 2.0.6+ds-3 in riscv64 (Release)
- node-fast-levenshtein 2.0.6+ds-3 in s390x (Release)