all options
buster  ] [  bullseye  ] [  bookworm  ] [  trixie  ] [  sid  ]
[ Source: node-fast-levenshtein  ]

Пакунок: node-fast-levenshtein (2.0.6+ds-3)

Links for node-fast-levenshtein

Screenshot

Debian Resources:

Download Source Package node-fast-levenshtein:

Maintainers:

External Resources:

Similar packages:

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 [список файлів]