{
  "name": "levdist",
  "version": "2.2.12",
  "description": "A minimal algorithm for computing Levenshtein distance in JavaScript.",
  "main": "lib/index.js",
  "types": "lib/index.d.ts",
  "directories": {
    "example": "example"
  },
  "scripts": {
    "test": "node example/index"
  },
  "repository": {
    "type": "git",
    "url": "git@github.com:IonicaBizau/node-levdist.git"
  },
  "keywords": [
    "levenshtein",
    "distance"
  ],
  "author": "Ionică Bizău <bizauionica@gmail.com> (https://ionicabizau.net)",
  "contributors": [
    "Jonas Brussat <bombastickj@gmail.com>"
  ],
  "license": "MIT",
  "bugs": {
    "url": "https://github.com/IonicaBizau/node-levdist/issues"
  },
  "homepage": "https://github.com/IonicaBizau/node-levdist",
  "files": [
    "bin/",
    "app/",
    "lib/",
    "dist/",
    "src/",
    "scripts/",
    "resources/",
    "menu/",
    "cli.js",
    "index.js",
    "index.d.ts",
    "package-lock.json",
    "bloggify.js",
    "bloggify.json",
    "bloggify/"
  ]
}