{ "_from": "string-similarity@^4.0.1", "_id": "string-similarity@4.0.1", "_inBundle": false, "_integrity": "sha512-v36MJzloekKVvKAsYi6O/qpn2mIuvwEFIT9Gx3yg4spkNjXYsk7yxc37g4ZTyMVIBvt/9PZGxnqEtme8XHK+Mw==", "_location": "/string-similarity", "_phantomChildren": {}, "_requested": { "type": "range", "registry": true, "raw": "string-similarity@^4.0.1", "name": "string-similarity", "escapedName": "string-similarity", "rawSpec": "^4.0.1", "saveSpec": null, "fetchSpec": "^4.0.1" }, "_requiredBy": [ "/fast-json-stringify" ], "_resolved": "https://registry.npmjs.org/string-similarity/-/string-similarity-4.0.1.tgz", "_shasum": "ea7c11f0093cb3088cdcc5eb16cfd90cb54962f7", "_spec": "string-similarity@^4.0.1", "_where": "/home/herrhase/Workspace/tentakelfabrik/board/node_modules/fast-json-stringify", "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.4.0", "webpack": "^4.41.5", "webpack-cli": "^3.3.10" }, "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.1" }