{"_id":"js-levenshtein","_rev":"40450","name":"js-levenshtein","description":"The most efficient JS implementation calculating the Levenshtein distance, i.e. the difference between two strings.","dist-tags":{"latest":"1.1.6"},"maintainers":[{"name":"ggustf","email":"gustaf@me.com"}],"time":{"modified":"2021-06-03T10:12:08.000Z","created":"2017-05-14T19:55:03.805Z","1.1.6":"2019-01-10T21:27:12.131Z","1.1.5":"2019-01-08T11:05:22.904Z","1.1.4":"2018-09-27T11:13:54.100Z","1.1.3":"2017-10-01T18:21:49.162Z","1.1.2":"2017-06-19T14:37:01.413Z","1.1.1":"2017-06-03T19:42:01.528Z","1.1.0":"2017-06-01T20:16:30.339Z","1.0.0":"2017-05-14T19:55:03.805Z"},"users":{},"author":{"name":"Gustaf Andersson","email":"gustaf@me.com"},"repository":{"type":"git","url":"git+https://github.com/gustf/js-levenshtein.git"},"versions":{"1.1.6":{"name":"js-levenshtein","version":"1.1.6","description":"The most efficient JS implementation calculating the Levenshtein distance, i.e. the difference between two strings.","license":"MIT","repository":{"type":"git","url":"git+https://github.com/gustf/js-levenshtein.git"},"author":{"name":"Gustaf Andersson","email":"gustaf@me.com"},"engines":{"node":">=0.10.0"},"scripts":{"test":"ava","bench":"matcha bench.js"},"keywords":["levenshtein","distance","algorithm","algo","string","difference","diff","fast","fuzzy","similar","similarity","compare","comparison","edit","text","match","matching"],"devDependencies":{"ava":"^0.25.0","fast-levenshtein":"^2.0.6","levenshtein-edit-distance":"^2.0.3","matcha":"^0.7.0","talisman":"^0.21.0","leven":"^2.1.0","xo":"^0.23.0"},"gitHead":"55ca1bf22bd55aa81cb5836c63582da6e9fb5fb0","bugs":{"url":"https://github.com/gustf/js-levenshtein/issues"},"homepage":"https://github.com/gustf/js-levenshtein#readme","_id":"js-levenshtein@1.1.6","_npmVersion":"6.5.0","_nodeVersion":"8.12.0","_npmUser":{"name":"ggustf","email":"gustaf@me.com"},"dist":{"shasum":"c6cee58eb3550372df8deb85fad5ce66ce01d59d","size":2450,"noattachment":false,"key":"/js-levenshtein/-/js-levenshtein-1.1.6.tgz","tarball":"http://registry.cnpm.dingdandao.com/js-levenshtein/download/js-levenshtein-1.1.6.tgz"},"maintainers":[{"name":"ggustf","email":"gustaf@me.com"}],"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/js-levenshtein_1.1.6_1547155631959_0.25810786473179337"},"_hasShrinkwrap":false,"publish_time":1547155632131,"_cnpm_publish_time":1547155632131},"1.1.5":{"name":"js-levenshtein","version":"1.1.5","description":"The most efficient JS implementation calculating the Levenshtein distance, i.e. the difference between two strings.","license":"MIT","repository":{"type":"git","url":"git+https://github.com/gustf/js-levenshtein.git"},"author":{"name":"Gustaf Andersson","email":"gustaf@me.com"},"engines":{"node":">=0.10.0"},"scripts":{"test":"ava","bench":"matcha bench.js"},"main":"index.js","types":"index.d.ts","keywords":["levenshtein","distance","algorithm","algo","string","difference","diff","fast","fuzzy","similar","similarity","compare","comparison","edit","text","match","matching"],"devDependencies":{"ava":"^0.25.0","fast-levenshtein":"^2.0.6","levenshtein-edit-distance":"^2.0.3","matcha":"^0.7.0","talisman":"^0.21.0","leven":"^2.1.0","xo":"^0.23.0"},"gitHead":"7a4a86ac401b6737a7041b6f2d430e3ee93cd02d","bugs":{"url":"https://github.com/gustf/js-levenshtein/issues"},"homepage":"https://github.com/gustf/js-levenshtein#readme","_id":"js-levenshtein@1.1.5","_npmVersion":"6.5.0","_nodeVersion":"8.12.0","_npmUser":{"name":"ggustf","email":"gustaf@me.com"},"dist":{"shasum":"57e4b1b5cc35e6d2721f118bd5245b36ac56b253","size":2530,"noattachment":false,"key":"/js-levenshtein/-/js-levenshtein-1.1.5.tgz","tarball":"http://registry.cnpm.dingdandao.com/js-levenshtein/download/js-levenshtein-1.1.5.tgz"},"maintainers":[{"name":"ggustf","email":"gustaf@me.com"}],"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/js-levenshtein_1.1.5_1546945522669_0.8967331751317618"},"_hasShrinkwrap":false,"publish_time":1546945522904,"_cnpm_publish_time":1546945522904},"1.1.4":{"name":"js-levenshtein","version":"1.1.4","description":"The most efficient JS implementation calculating the Levenshtein distance, i.e. the difference between two strings.","license":"MIT","repository":{"type":"git","url":"git+https://github.com/gustf/js-levenshtein.git"},"author":{"name":"Gustaf Andersson","email":"gustaf@me.com"},"engines":{"node":">=0.10.0"},"scripts":{"test":"ava","bench":"matcha bench.js"},"keywords":["levenshtein","distance","algorithm","algo","string","difference","diff","fast","fuzzy","similar","similarity","compare","comparison","edit","text","match","matching"],"devDependencies":{"ava":"^0.25.0","fast-levenshtein":"^2.0.6","levenshtein-edit-distance":"^2.0.3","matcha":"^0.7.0","talisman":"^0.21.0","leven":"^2.1.0","xo":"^0.23.0"},"gitHead":"4dad5f5bcf0ac990bba06546a5cea9e3cec5e612","bugs":{"url":"https://github.com/gustf/js-levenshtein/issues"},"homepage":"https://github.com/gustf/js-levenshtein#readme","_id":"js-levenshtein@1.1.4","_npmVersion":"6.4.1","_nodeVersion":"8.12.0","_npmUser":{"name":"ggustf","email":"gustaf@me.com"},"dist":{"shasum":"3a56e3cbf589ca0081eb22cd9ba0b1290a16d26e","size":2477,"noattachment":false,"key":"/js-levenshtein/-/js-levenshtein-1.1.4.tgz","tarball":"http://registry.cnpm.dingdandao.com/js-levenshtein/download/js-levenshtein-1.1.4.tgz"},"maintainers":[{"name":"ggustf","email":"gustaf@me.com"}],"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/js-levenshtein_1.1.4_1538046833866_0.6540345455046683"},"_hasShrinkwrap":false,"publish_time":1538046834100,"_cnpm_publish_time":1538046834100},"1.1.3":{"name":"js-levenshtein","version":"1.1.3","description":"The most efficient JS implementation calculating the Levenshtein distance, i.e. the difference between two strings.","license":"MIT","repository":{"type":"git","url":"git+https://github.com/gustf/js-levenshtein.git"},"author":{"name":"Gustaf Andersson","email":"gustaf@me.com"},"engines":{"node":">=0.10.0"},"scripts":{"test":"ava","bench":"matcha bench.js"},"files":["index.js"],"keywords":["leven","levenshtein","distance","algorithm","algo","string","difference","diff","fast","fuzzy","similar","similarity","compare","comparison","edit","text","match","matching"],"devDependencies":{"ava":"^0.17.0","fast-levenshtein":"^2.0.5","levenshtein-edit-distance":"^2.0.0","matcha":"^0.7.0","talisman":"^0.18.0","leven":"^2.1.0","xo":"^0.16.0"},"gitHead":"9c31fcbd827550ee60e19a9d19676981a5e40136","bugs":{"url":"https://github.com/gustf/js-levenshtein/issues"},"homepage":"https://github.com/gustf/js-levenshtein#readme","_id":"js-levenshtein@1.1.3","_npmVersion":"5.3.0","_nodeVersion":"8.6.0","_npmUser":{"name":"ggustf","email":"gustaf@me.com"},"dist":{"shasum":"3ef627df48ec8cf24bacf05c0f184ff30ef413c5","size":1815,"noattachment":false,"key":"/js-levenshtein/-/js-levenshtein-1.1.3.tgz","tarball":"http://registry.cnpm.dingdandao.com/js-levenshtein/download/js-levenshtein-1.1.3.tgz"},"maintainers":[{"name":"ggustf","email":"gustaf@me.com"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/js-levenshtein-1.1.3.tgz_1506882108196_0.6311669612769037"},"directories":{},"publish_time":1506882109162,"_hasShrinkwrap":false,"_cnpm_publish_time":1506882109162},"1.1.2":{"name":"js-levenshtein","version":"1.1.2","description":"The most efficient JS implementation calculating the Levenshtein distance, i.e. the difference between two strings.","license":"MIT","repository":{"type":"git","url":"git+https://github.com/gustf/js-levenshtein.git"},"author":{"name":"Gustaf Andersson","email":"gustaf@me.com"},"engines":{"node":">=0.10.0"},"scripts":{"test":"ava","bench":"matcha bench.js"},"files":["index.js"],"keywords":["leven","levenshtein","distance","algorithm","algo","string","difference","diff","fast","fuzzy","similar","similarity","compare","comparison","edit","text","match","matching"],"devDependencies":{"ava":"^0.17.0","fast-levenshtein":"^2.0.5","ld":"^0.1.0","levdist":"^2.0.0","levenshtein":"^1.0.4","levenshtein-component":"0.0.1","levenshtein-edit-distance":"^2.0.0","matcha":"^0.7.0","natural":"^0.4.0","talisman":"^0.18.0","leven":"^2.1.0","xo":"^0.16.0"},"gitHead":"b4226846e87a8952dfc141f9a67ab0f7104b5ab7","bugs":{"url":"https://github.com/gustf/js-levenshtein/issues"},"homepage":"https://github.com/gustf/js-levenshtein#readme","_id":"js-levenshtein@1.1.2","_npmVersion":"5.0.3","_nodeVersion":"8.1.2","_npmUser":{"name":"ggustf","email":"gustaf@me.com"},"dist":{"shasum":"e998a756624df6b5500b8db00cafa926db7a8094","size":2029,"noattachment":false,"key":"/js-levenshtein/-/js-levenshtein-1.1.2.tgz","tarball":"http://registry.cnpm.dingdandao.com/js-levenshtein/download/js-levenshtein-1.1.2.tgz"},"maintainers":[{"name":"ggustf","email":"gustaf@me.com"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/js-levenshtein-1.1.2.tgz_1497883019848_0.8090394716709852"},"directories":{},"publish_time":1497883021413,"_hasShrinkwrap":false,"_cnpm_publish_time":1497883021413},"1.1.1":{"name":"js-levenshtein","version":"1.1.1","description":"An efficient JS implementation calculating the Levenshtein distance, i.e. the difference between two strings.","license":"MIT","repository":{"type":"git","url":"git+https://github.com/gustf/js-levenshtein.git"},"author":{"name":"Gustaf Andersson","email":"gustaf@me.com"},"engines":{"node":">=0.10.0"},"scripts":{"test":"ava","bench":"matcha bench.js"},"files":["index.js","cached.js"],"keywords":["leven","levenshtein","distance","algorithm","algo","string","difference","diff","fast","fuzzy","similar","similarity","compare","comparison","edit","text","match","matching"],"devDependencies":{"ava":"^0.17.0","fast-levenshtein":"^2.0.5","ld":"^0.1.0","levdist":"^2.0.0","levenshtein":"^1.0.4","levenshtein-component":"0.0.1","levenshtein-edit-distance":"^2.0.0","matcha":"^0.7.0","natural":"^0.4.0","talisman":"^0.18.0","leven":"^2.1.0","xo":"^0.16.0"},"gitHead":"f1292abbf738ebe76975019ab5304ff665ad2902","bugs":{"url":"https://github.com/gustf/js-levenshtein/issues"},"homepage":"https://github.com/gustf/js-levenshtein#readme","_id":"js-levenshtein@1.1.1","_shasum":"97307576aa49d5b328cbda54cf1e8d2a4f55ef9a","_from":".","_npmVersion":"4.2.0","_nodeVersion":"8.0.0","_npmUser":{"name":"ggustf","email":"gustaf@me.com"},"dist":{"shasum":"97307576aa49d5b328cbda54cf1e8d2a4f55ef9a","size":1870,"noattachment":false,"key":"/js-levenshtein/-/js-levenshtein-1.1.1.tgz","tarball":"http://registry.cnpm.dingdandao.com/js-levenshtein/download/js-levenshtein-1.1.1.tgz"},"maintainers":[{"name":"ggustf","email":"gustaf@me.com"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/js-levenshtein-1.1.1.tgz_1496518920548_0.331609015353024"},"directories":{},"publish_time":1496518921528,"_hasShrinkwrap":false,"_cnpm_publish_time":1496518921528},"1.1.0":{"name":"js-levenshtein","version":"1.1.0","description":"An efficient JS implementation calculating the Levenshtein distance, i.e. the difference between two strings.","license":"MIT","repository":{"type":"git","url":"git+https://github.com/gustf/js-levenshtein.git"},"author":{"name":"Gustaf Andersson","email":"gustaf@me.com"},"engines":{"node":">=0.10.0"},"scripts":{"test":"ava","bench":"matcha bench.js"},"files":["index.js"],"keywords":["leven","levenshtein","distance","algorithm","algo","string","difference","diff","fast","fuzzy","similar","similarity","compare","comparison","edit","text","match","matching"],"devDependencies":{"ava":"^0.17.0","fast-levenshtein":"^2.0.5","ld":"^0.1.0","levdist":"^2.0.0","levenshtein":"^1.0.4","levenshtein-component":"0.0.1","levenshtein-edit-distance":"^2.0.0","matcha":"^0.7.0","natural":"^0.4.0","talisman":"^0.18.0","leven":"^2.1.0","xo":"^0.16.0"},"gitHead":"256ff7f1ae1f2d81b8baa6d02fc7d5caac4c373b","bugs":{"url":"https://github.com/gustf/js-levenshtein/issues"},"homepage":"https://github.com/gustf/js-levenshtein#readme","_id":"js-levenshtein@1.1.0","_shasum":"103397d99f794a13fa9124b5bf4e17551b3ec3b2","_from":".","_npmVersion":"4.2.0","_nodeVersion":"8.0.0","_npmUser":{"name":"ggustf","email":"gustaf@me.com"},"dist":{"shasum":"103397d99f794a13fa9124b5bf4e17551b3ec3b2","size":1770,"noattachment":false,"key":"/js-levenshtein/-/js-levenshtein-1.1.0.tgz","tarball":"http://registry.cnpm.dingdandao.com/js-levenshtein/download/js-levenshtein-1.1.0.tgz"},"maintainers":[{"name":"ggustf","email":"gustaf@me.com"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/js-levenshtein-1.1.0.tgz_1496348189408_0.47005335544236004"},"directories":{},"publish_time":1496348190339,"_cnpm_publish_time":1496348190339,"_hasShrinkwrap":false},"1.0.0":{"name":"js-levenshtein","version":"1.0.0","description":"An efficient JS implementation calculating the Levenshtein distance, i.e. the difference between two strings.","license":"MIT","repository":{"type":"git","url":"git+https://github.com/gustf/js-levenshtein.git"},"author":{"name":"Gustaf Andersson","email":"gustaf@me.com"},"engines":{"node":">=0.10.0"},"scripts":{"test":"ava","bench":"matcha bench.js"},"files":["index.js"],"keywords":["leven","levenshtein","distance","algorithm","algo","string","difference","diff","fast","fuzzy","similar","similarity","compare","comparison","edit","text","match","matching"],"devDependencies":{"ava":"^0.17.0","fast-levenshtein":"^2.0.5","ld":"^0.1.0","levdist":"^2.0.0","levenshtein":"^1.0.4","levenshtein-component":"0.0.1","levenshtein-edit-distance":"^2.0.0","matcha":"^0.7.0","natural":"^0.4.0","talisman":"^0.18.0","leven":"^2.1.0","xo":"^0.16.0"},"gitHead":"b79f343fc67d4c338efd2d52c1df8250da858630","bugs":{"url":"https://github.com/gustf/js-levenshtein/issues"},"homepage":"https://github.com/gustf/js-levenshtein#readme","_id":"js-levenshtein@1.0.0","_shasum":"cc2d6be5cba7a2e83aef8560ab6502b5c1beef8f","_from":".","_npmVersion":"4.6.1","_nodeVersion":"7.4.0","_npmUser":{"name":"ggustf","email":"gustaf@me.com"},"dist":{"shasum":"cc2d6be5cba7a2e83aef8560ab6502b5c1beef8f","size":1669,"noattachment":false,"key":"/js-levenshtein/-/js-levenshtein-1.0.0.tgz","tarball":"http://registry.cnpm.dingdandao.com/js-levenshtein/download/js-levenshtein-1.0.0.tgz"},"maintainers":[{"name":"ggustf","email":"gustaf@me.com"}],"_npmOperationalInternal":{"host":"packages-12-west.internal.npmjs.com","tmp":"tmp/js-levenshtein-1.0.0.tgz_1494791701836_0.9638541722670197"},"directories":{},"publish_time":1494791703805,"_hasShrinkwrap":false,"_cnpm_publish_time":1494791703805}},"readme":"# js-levenshtein [![Build Status](https://travis-ci.org/gustf/js-levenshtein.svg?branch=master)](https://travis-ci.org/gustf/js-levenshtein)\n\nA very efficient JS implementation calculating the Levenshtein distance, i.e. the difference between two strings.\n\nBased on Wagner-Fischer dynamic programming algorithm, optimized for speed and memory\n - use a single distance vector instead of a matrix\n - loop unrolling on the outer loop\n - remove common prefixes/postfixes from the calculation\n - minimize the number of comparisons\n \n## Install\n\n```\n$ npm install --save js-levenshtein\n```\n\n\n## Usage\n\n```js\nconst levenshtein = require('js-levenshtein');\n\nlevenshtein('kitten', 'sitting');\n//=> 3\n```\n\n\n## Benchmark\n\n```\n$ npm run bench\n  \n                      50 paragraphs, length max=500 min=240 avr=372.5\n             162 op/s » js-levenshtein\n              98 op/s » talisman\n              94 op/s » levenshtein-edit-distance\n              85 op/s » leven\n              39 op/s » fast-levenshtein\n\n                      100 sentences, length max=170 min=6 avr=57.5\n           3,076 op/s » js-levenshtein\n           2,024 op/s » talisman\n           1,817 op/s » levenshtein-edit-distance\n           1,633 op/s » leven\n             800 op/s » fast-levenshtein\n\n                      2000 words, length max=20 min=3 avr=9.5\n           3,119 op/s » js-levenshtein\n           2,416 op/s » talisman\n           2,141 op/s » levenshtein-edit-distance\n           1,855 op/s » leven\n           1,260 op/s » fast-levenshtein\n```\n\nBenchmarks was performed with node v8.12.0 on a MacBook Pro 15\", 2.9 GHz Intel Core i9\n\n## License\n\nMIT © Gustaf Andersson","_attachments":{},"homepage":"https://github.com/gustf/js-levenshtein#readme","bugs":{"url":"https://github.com/gustf/js-levenshtein/issues"},"license":"MIT"}