{"bugs":{"url":"https://github.com/IonicaBizau/node-levdist/issues"},"dist":{"shasum":"0fa523ee91a9d148f8dd40452755353ec27cefae","tarball":"https://registry.npmjs.org/levdist/-/levdist-2.2.7.tgz","integrity":"sha512-kyDkHHol4yGU5Si6CbH1wUoXLJgHzBNPMXPAPFMrX9EpP5lQ5P6s5oSAG8pXz1wbWEMNn6b61eW2PkNEZ3yD6A==","signatures":[{"sig":"MEUCIFxK9eoTZOhaC8jM4IF3rvX5wAnJ8jaIhZTgxwOljb3oAiEAqLyoUAbw2zKR76aFto5fI1jEh0lWkK6kBIEyvnGLZBw=","keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA"}]},"main":"lib/index.js","name":"levdist","_from":".","files":["bin/","app/","lib/","dist/","src/","scripts/","resources/","menu/","cli.js","index.js"],"author":{"url":"https://ionicabizau.net","name":"Ionică Bizău","email":"bizauionica@gmail.com"},"_shasum":"0fa523ee91a9d148f8dd40452755353ec27cefae","gitHead":"876158ae0438b4494743a43eed9398dc4a7cabb8","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":"3.10.8","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.7.tgz_1490288358345_0.7600238893646747","host":"packages-18-east.internal.npmjs.com"},"_id":"levdist@2.2.7","version":"2.2.7"}