deb_control_files:
- control
- md5sums
deb_fields:
Architecture: all
Description: |-
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.
Homepage: https://github.com/hiddentao/fast-levenshtein
Installed-Size: '22'
Maintainer: Debian Javascript Maintainers <pkg-javascript-devel@lists.alioth.debian.org>
Multi-Arch: foreign
Package: node-fast-levenshtein
Priority: optional
Section: javascript
Version: 2.0.6+ds-3
srcpkg_name: node-fast-levenshtein
srcpkg_version: 2.0.6+ds-3