[ 原始碼： node-fast-levenshtein ]
套件：node-fast-levenshtein（2.0.6+ds-3）
node-fast-levenshtein 的相關連結
Debian 的資源：
下載原始碼套件 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]
維護小組：
外部的資源：
- 主頁 [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.