qlevens
Version:
A lightning-fast implementation of the Levenshtein distance algorithm. Written in AssemblyScript, compiled to WebAssembly, and optimized for speed.
51 lines (50 loc) • 1.32 kB
JSON
{
"name": "qlevens",
"version": "1.0.3",
"description": "A lightning-fast implementation of the Levenshtein distance algorithm. Written in AssemblyScript, compiled to WebAssembly, and optimized for speed.",
"main": "build/release.js",
"scripts": {
"prepublishOnly": "npm run asbuild:release",
"test": "node tests",
"asbuild:debug": "asc src/index.ts -b build/debug.wasm -t build/debug.wat --sourceMap --debug",
"asbuild:release": "asc src/index.ts -b build/release.wasm -t build/release.wat --sourceMap -O3",
"asbuild": "npm run asbuild:debug && npm run asbuild:release",
"start": "npx serve ."
},
"author": "hex2w <hex2w@proton.me>",
"license": "MIT",
"repository": {
"type": "git",
"url": "git@github.com:hex2w/qlevens.git"
},
"keywords": [
"levenshtein",
"levenshtein-wasm",
"levenshtein-distance",
"distance",
"algorithm",
"assemblyscript",
"wasm",
"webassembly",
"string",
"compare",
"fast",
"fastest",
"match",
"difference",
"text"
],
"bugs": {
"url": "https://github.com/hex2w/qlevens/issues"
},
"type": "module",
"exports": {
".": {
"import": "./build/release.js",
"types": "./build/release.d.ts"
}
},
"devDependencies": {
"assemblyscript": "^0.21.3"
}
}