{"bugs":{"url":"https://github.com/IonicaBizau/node-levdist/issues"},"dist":{"shasum":"4219cf93441fce1a2369d418101584081a726509","tarball":"https://registry.npmjs.org/levdist/-/levdist-2.2.0.tgz","integrity":"sha512-vdBIPhRhYwziacdei378LlobI/3ylbG5wDFFabBxwmu3ks/l1CE02hzdneFu2+5A8g8Fp17mViphwacyKq83PA==","signatures":[{"sig":"MEUCIQDJZpCB1xc+mkryC1G1PY2Uo0NQtNelsTWEnBoJS/5rdwIgf3i4jlajWDhbN3bSEmTWwdqb0y9BDa9PtREPfYZzzUI=","keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA"}]},"main":"lib/index.js","name":"levdist","_from":".","author":{"url":"http://ionicabizau.net","name":"Ionică Bizău","email":"bizauionica@gmail.com"},"_shasum":"4219cf93441fce1a2369d418101584081a726509","gitHead":"c24563b0a1428822bb24fa66cd8557e3257949df","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":"2.14.2","description":"A minimal algorithm for computing Levenshtein distance in JavaScript.","directories":{"example":"example"},"maintainers":[{"name":"ionicabizau","email":"bizauionica@yahoo.com"}],"_nodeVersion":"4.0.0","_id":"levdist@2.2.0","version":"2.2.0"}