{"bugs":{"url":"https://github.com/IonicaBizau/node-levdist/issues"},"dist":{"shasum":"f17906578005096a0924ad554ddc8df41d2949c5","tarball":"https://registry.npmjs.org/levdist/-/levdist-2.2.8.tgz","integrity":"sha512-zmYkuyufzUlYE3eZgsbrZWvOQGxIjTAw7EtVsodLDjKNwblFKBzFASWJktfgUVeA6emHKv+X0vt1n3RD8dwVfg==","signatures":[{"sig":"MEUCIQDJ90/Grz2de5RVy/i4pPr7JXJFeknnb5nLFauQSExR/wIgElvBhdDkVrbEr8gYtB44Agz2+pj3KWVdTAGAJqEgovw=","keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA"}]},"main":"lib/index.js","name":"levdist","_from":".","files":["bin/","app/","lib/","dist/","src/","scripts/","resources/","menu/","cli.js","index.js","bloggify.js","bloggify.json","bloggify/"],"author":{"url":"https://ionicabizau.net","name":"Ionică Bizău","email":"bizauionica@gmail.com"},"_shasum":"f17906578005096a0924ad554ddc8df41d2949c5","gitHead":"18103503fe9c48ed87d16e76dce490d1854fc7c9","license":"MIT","scripts":{"test":"node example/index"},"_npmUser":{"name":"ionicabizau","email":"bizauionica@gmail.com"},"homepage":"https://github.com/IonicaBizau/node-levdist","keywords":["levenshtein","distance"],"repository":{"url":"git+ssh://git@github.com/IonicaBizau/node-levdist.git","type":"git"},"_npmVersion":"4.1.1","description":"A minimal algorithm for computing Levenshtein distance in JavaScript.","directories":{"example":"example"},"maintainers":[{"name":"ionicabizau","email":"bizauionica@yahoo.com"}],"_nodeVersion":"7.0.0","_npmOperationalInternal":{"tmp":"tmp/levdist-2.2.8.tgz_1504874060403_0.9589318656362593","host":"s3://npm-registry-packages"},"_id":"levdist@2.2.8","version":"2.2.8"}