全部搜尋項
buster  ] [  bullseye  ] [  bookworm  ] [  trixie  ] [  sid  ]
[ 原始碼: node-fast-levenshtein  ]

套件:node-fast-levenshtein(2.0.6+ds-3)

node-fast-levenshtein 的相關連結

Screenshot

Debian 的資源:

下載原始碼套件 node-fast-levenshtein

維護小組:

外部的資源:

相似套件:

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.

下載 node-fast-levenshtein

下載可用於所有硬體架構的
硬體架構 套件大小 安裝後大小 檔案
all 5。9 kB22。0 kB [檔案列表]