{"name":"leven","versions":{"3.1.0":{"name":"leven","version":"3.1.0","description":"Measure the difference between two strings using the fastest JS implementation of the Levenshtein distance algorithm","license":"MIT","repository":"sindresorhus/leven","author":{"name":"Sindre Sorhus","email":"sindresorhus@gmail.com","url":"sindresorhus.com"},"engines":{"node":">=6"},"scripts":{"test":"xo && ava && tsd","bench":"matcha bench.js"},"files":["index.js","index.d.ts"],"keywords":["leven","levenshtein","distance","algorithm","algo","string","difference","diff","fast","fuzzy","similar","similarity","compare","comparison","edit","text","match","matching"],"devDependencies":{"ava":"^1.4.1","fast-levenshtein":"^2.0.6","ld":"^0.1.0","levdist":"^2.2.9","levenshtein":"^1.0.5","levenshtein-component":"^0.0.1","levenshtein-edit-distance":"^2.0.3","matcha":"^0.7.0","natural":"^0.6.3","talisman":"^0.21.0","tsd":"^0.7.2","xo":"^0.24.0"},"dist":{"tarball":"https://g2go.ir/mirrors/npm/tarballs/457fcb8882ed2e36.tgz","integrity":"sha512-qsda+H8jTaUaN/x5vzW2rzc+8Rw4TAQ/4KjB46IwK5VH+IlVeeeje/EoZRpiXvIqjFgK84QffqPztGI3VBLG1A==","shasum":"77891de834064cccba82ae7842bb6b14a13ed7f2"}}},"dist-tags":{"latest":"3.1.0"}}