[ 源代码: node-fast-levenshtein ]
软件包: node-fast-levenshtein (2.0.6+ds-3)
node-fast-levenshtein 的相关链接
Trisquel 的资源:
下载源码包 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]
维护者:
Original Maintainers:
- Debian Javascript Maintainers (Mail Archive)
- Pirate Praveen
外部的资源:
- 主页 [github.com]
相似软件包:
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.