{"bugs":{"url":"https://github.com/IonicaBizau/node-levdist/issues"},"dist":{"shasum":"3dffe75dac8f1f14ff706df9ad345d7a5dfe7a9f","tarball":"https://registry.npmjs.org/levdist/-/levdist-2.2.6.tgz","integrity":"sha512-jeg1XHzcFsczY1OVuBYlPoBJsuxruFHX2IeVr0Rm03At7vo2JMGseHZaCK4nLUSQgEGGsbSTvXtCxYETDbD3vw==","signatures":[{"sig":"MEQCIFyOmKQ/58ifBs3liuOxoEVYAIswCIX4s1gtETOnfNLuAiA6pQX+tMae6yXETjNT64/yxQPDH1FSj/pPGoAnCAtexA==","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":"3dffe75dac8f1f14ff706df9ad345d7a5dfe7a9f","gitHead":"8d9c1d8eaa34d8408bfc760ee1e46feebd84e5e6","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.6.tgz_1490036316560_0.022205690387636423","host":"packages-12-west.internal.npmjs.com"},"_id":"levdist@2.2.6","version":"2.2.6"}