Skip to content
Sections
>> Trisquel >> Balíky >> aramo >> web >> node-fast-levenshtein
etiona  ] [  nabia  ] [  aramo  ]
[ Zdroj: node-fast-levenshtein  ]

Balík: node-fast-levenshtein (2.0.6+ds-3)

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.

Stiahnuť node-fast-levenshtein

Stiahnuť pre všetky dostupné architektúry
Architektúra Veľkosť balíka Nainštalovaná veľkosť Súbory
all 5.9 kB22 kB [zoznam súborov]