{
  "_from": "string-similarity@^3.0.0",
  "_id": "string-similarity@3.0.0",
  "_inBundle": false,
  "_integrity": "sha512-7kS7LyTp56OqOI2BDWQNVnLX/rCxIQn+/5M0op1WV6P8Xx6TZNdajpuqQdiJ7Xx+p1C5CsWMvdiBp9ApMhxzEQ==",
  "_location": "/string-similarity",
  "_phantomChildren": {},
  "_requested": {
    "type": "range",
    "registry": true,
    "raw": "string-similarity@^3.0.0",
    "name": "string-similarity",
    "escapedName": "string-similarity",
    "rawSpec": "^3.0.0",
    "saveSpec": null,
    "fetchSpec": "^3.0.0"
  },
  "_requiredBy": [
    "#USER",
    "/"
  ],
  "_resolved": "https://registry.npmjs.org/string-similarity/-/string-similarity-3.0.0.tgz",
  "_shasum": "07b0bc69fae200ad88ceef4983878d03793847c7",
  "_spec": "string-similarity@^3.0.0",
  "_where": "D:\\5CHITM\\Diplomarbeit\\repos\\SmartShopper\\express-server",
  "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.3.0"
  },
  "files": [
    "compare-strings.js"
  ],
  "homepage": "https://github.com/aceakash/string-similarity#readme",
  "keywords": [
    "strings",
    "similar",
    "difference",
    "similarity",
    "compare",
    "comparison",
    "degree",
    "match",
    "matching",
    "dice",
    "levenshtein"
  ],
  "license": "ISC",
  "main": "compare-strings.js",
  "name": "string-similarity",
  "repository": {
    "type": "git",
    "url": "git://github.com/aceakash/string-similarity.git"
  },
  "scripts": {
    "test": "jasmine"
  },
  "version": "3.0.0"
}