UNPKG

search-fuzzy

Version:

A simple fuzzy search algorithm that uses the Levenshtein distance algorithm to find the closest match to a given string.

34 lines (32 loc) 903 B
{ "name": "search-fuzzy", "version": "1.1.3", "main": "dist/index.js", "module": "dist/index.mjs", "types": "dist/index.d.ts", "repository": { "url": " https://github.com/JaswanthDarapaneni/search-fuzzy.git" }, "scripts": { "dev": "node src/__tests__/test.js", "build": "tsup", "test": "jest" }, "keywords": [ "search-fuzzy", "fuzzy", "search", "fuzzy-search", "search-algorithm", "levenshtein", "levenshtein-distance" ], "author": "Jaswanth Darapaneni ", "license": "MIT", "description": " A simple fuzzy search algorithm that uses the Levenshtein distance algorithm to find the closest match to a given string.", "devDependencies": { "@types/jest": "^29.5.12", "@types/node": "^22.5.1", "jest": "^29.7.0", "ts-jest": "^29.2.5", "ts-node": "^10.9.2", "typescript": "^5.5.4" }, "dependencies": { "tsup": "^8.2.4" } }