[ Bron: node-fast-levenshtein ]
Pakket: node-fast-levenshtein (2.0.6+ds-3)
Verwijzigingen voor node-fast-levenshtein
Debian bronnen:
Het bronpakket node-fast-levenshtein downloaden:
- [node-fast-levenshtein_2.0.6+ds-3.dsc]
- [node-fast-levenshtein_2.0.6+ds.orig.tar.xz]
- [node-fast-levenshtein_2.0.6+ds-3.debian.tar.xz]
Beheerders:
Externe bronnen:
- Homepage [github.com]
Vergelijkbare pakketten:
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.