[ Källkod: node-fast-levenshtein ]
Paket: node-fast-levenshtein (2.0.6+ds-3)
Länkar för node-fast-levenshtein
Debianresurser:
Hämta källkodspaketet 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]
Ansvariga:
Externa resurser:
- Hemsida [github.com]
Liknande paket:
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.
Hämta node-fast-levenshtein
| Arkitektur | Paketstorlek | Installerad storlek | Filer |
|---|---|---|---|
| all | 5,9 kbyte | 22,0 kbyte | [filförteckning] |