{"bugs":{"url":"https://github.com/IonicaBizau/node-levdist/issues"},"dist":{"shasum":"66a2d36c924d367dfb78f705cf3e729647b6c04f","tarball":"https://registry.npmjs.org/levdist/-/levdist-2.2.3.tgz","integrity":"sha512-s4sXzgBI6sbpopQw5k1ZX2C+Em0jUm8sV3oC+J3gxYpvSeoD8+ud912r9GYaL75x6EFLIaqNnXg3Pt7QejfXag==","signatures":[{"sig":"MEUCIQCAmlJtUWxXhW1lvdgACLVz5MVi61VR7G5FNqxs5zlhQAIgLq7R89xqsyOFdhU26RSNr/8d7q1sx1WqCsDT79/1XMs=","keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA"}]},"main":"lib/index.js","name":"levdist","_from":".","files":["bin/","app/","lib/","dist/","src/","resources/","menu/","scripts/","cli.js","index.js"],"author":{"url":"http://ionicabizau.net","name":"Ionică Bizău","email":"bizauionica@gmail.com"},"_shasum":"66a2d36c924d367dfb78f705cf3e729647b6c04f","gitHead":"cdf34fe1300c0c6397b6fa6deb1b7918e4dec951","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.8.9","description":"A minimal algorithm for computing Levenshtein distance in JavaScript.","directories":{"example":"example"},"maintainers":[{"name":"ionicabizau","email":"bizauionica@yahoo.com"}],"_nodeVersion":"6.2.0","_npmOperationalInternal":{"tmp":"tmp/levdist-2.2.3.tgz_1464173234076_0.7113349726423621","host":"packages-12-west.internal.npmjs.com"},"_id":"levdist@2.2.3","version":"2.2.3"}