{ "_from": "string-similarity", "_id": "string-similarity@4.0.2", "_inBundle": false, "_integrity": "sha512-eCsPPyoQBgY4TMpVD6DVfO7pLrimUONriaO4Xjp3WPUW0YnNLqdHgRj23xotLlqrL90eJhBeq3zdAJf2mQgfBQ==", "_location": "/string-similarity", "_phantomChildren": {}, "_requested": { "type": "tag", "registry": true, "raw": "string-similarity", "name": "string-similarity", "escapedName": "string-similarity", "rawSpec": "", "saveSpec": null, "fetchSpec": "latest" }, "_requiredBy": [ "#USER", "/" ], "_resolved": "https://registry.npmjs.org/string-similarity/-/string-similarity-4.0.2.tgz", "_shasum": "1dc29518d0e92e50509499ce2974368f77bbb1b1", "_spec": "string-similarity", "_where": "D:\\!Git\\NextGenSP", "author": { "name": "Akash Kurdekar", "email": "npm@kurdekar.com", "url": "http://untilfalse.com/" }, "bugs": { "url": "https://github.com/aceakash/string-similarity/issues" }, "bundleDependencies": false, "deprecated": false, "description": "Finds degree of similarity between strings, based on Dice's Coefficient, which is mostly better than Levenshtein distance.", "devDependencies": { "jasmine": "^3.6.1", "webpack": "^4.44.1", "webpack-cli": "^3.3.12" }, "files": [ "src/index.js", "umd/string-similarity.min.js" ], "homepage": "https://github.com/aceakash/string-similarity#readme", "keywords": [ "strings", "similar", "difference", "similarity", "compare", "comparison", "degree", "match", "matching", "dice", "levenshtein" ], "license": "ISC", "main": "src/index.js", "name": "string-similarity", "repository": { "type": "git", "url": "git://github.com/aceakash/string-similarity.git" }, "scripts": { "build": "rm -rf umd && webpack-cli", "prepublish": "npm test && npm run build", "test": "jasmine --config=src/spec/support/jasmine.json" }, "version": "4.0.2" }