[ Source: node-fast-levenshtein ]
Paketti: node-fast-levenshtein (2.0.6+ds-3)
Links for node-fast-levenshtein
Debian-palvelut:
Imuroi lähdekoodipaketti node-fast-levenshtein:
- [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]
Ylläpitäjät:
- Debian Javascript Maintainers (Laadunvalvontasivu, Mail Archive)
- Pirate Praveen (Laadunvalvontasivu)
External Resources:
- Kotisivu [github.com]
Samankaltaisia paketteja:
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.
Imuroi node-fast-levenshtein
| Arkkitehtuuri | Paketin koko | Koko asennettuna | Tiedostot |
|---|---|---|---|
| all | 5.9 kt | 22.0 kt | [tiedostoluettelo] |