{"_id":"string-similarity","_rev":"149689","name":"string-similarity","description":"Finds degree of similarity between strings, based on Dice's Coefficient, which is mostly better than Levenshtein distance.","dist-tags":{"latest":"4.0.4"},"maintainers":[{"name":"aceakash","email":"npm@kurdekar.com"}],"time":{"modified":"2024-08-27T19:06:18.000Z","created":"2014-11-27T00:28:42.024Z","4.0.4":"2021-01-06T08:44:44.129Z","4.0.3":"2020-11-09T21:36:15.541Z","4.0.2":"2020-08-03T16:47:50.240Z","4.0.1":"2020-01-02T19:29:53.729Z","4.0.0":"2020-01-02T19:17:42.982Z","3.0.0":"2018-11-29T21:24:46.618Z","2.0.0":"2018-10-02T15:06:13.039Z","1.2.2":"2018-09-12T09:44:00.191Z","1.2.1":"2018-08-23T21:44:28.801Z","1.2.0":"2017-05-22T15:16:13.057Z","1.1.0":"2016-06-06T15:36:37.590Z","1.0.0":"2014-11-27T00:28:42.024Z"},"users":{"diegoperini":true,"alcovegan":true,"recursion_excursion":true,"hugo-cornu":true,"albinekb":true,"visualheuristics":true,"danielo515":true,"vkalinichev":true,"mfaraday":true,"gggauravgandhi":true,"khaledalyawad":true,"thuanhai":true,"prtk":true,"thetimmaeh":true,"hani":true,"hoanganh25991":true},"author":{"name":"Akash Kurdekar","email":"npm@kurdekar.com","url":"http://untilfalse.com/"},"repository":{"type":"git","url":"git://github.com/aceakash/string-similarity.git"},"versions":{"4.0.4":{"name":"string-similarity","version":"4.0.4","description":"Finds degree of similarity between strings, based on Dice's Coefficient, which is mostly better than Levenshtein distance.","main":"src/index.js","scripts":{"test":"jasmine --config=src/spec/support/jasmine.json","build":"rm -rf umd && webpack-cli","prepublish":"npm test && npm run build"},"repository":{"type":"git","url":"git://github.com/aceakash/string-similarity.git"},"keywords":["strings","similar","difference","similarity","compare","comparison","degree","match","matching","dice","levenshtein"],"author":{"name":"Akash Kurdekar","email":"npm@kurdekar.com","url":"http://untilfalse.com/"},"license":"ISC","devDependencies":{"jasmine":"^3.6.3","webpack":"^5.11.1","webpack-cli":"^4.3.1"},"gitHead":"07cbc8d1569013a10c6075ce02d3efca71a5cfb6","bugs":{"url":"https://github.com/aceakash/string-similarity/issues"},"homepage":"https://github.com/aceakash/string-similarity#readme","_id":"string-similarity@4.0.4","_nodeVersion":"14.15.1","_npmVersion":"6.14.8","dist":{"shasum":"42d01ab0b34660ea8a018da8f56a3309bb8b2a5b","size":4366,"noattachment":false,"key":"/string-similarity/-/string-similarity-4.0.4.tgz","tarball":"http://registry.cnpm.dingdandao.com/string-similarity/download/string-similarity-4.0.4.tgz"},"_npmUser":{"name":"aceakash","email":"npm@kurdekar.com"},"directories":{},"maintainers":[{"name":"aceakash","email":"npm@kurdekar.com"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/string-similarity_4.0.4_1609922683988_0.6721303878184284"},"_hasShrinkwrap":false,"publish_time":1609922684129,"_cnpm_publish_time":1609922684129,"deprecated":"Package no longer supported. Contact Support at https://www.npmjs.com/support for more info."},"4.0.3":{"name":"string-similarity","version":"4.0.3","description":"Finds degree of similarity between strings, based on Dice's Coefficient, which is mostly better than Levenshtein distance.","main":"src/index.js","scripts":{"test":"jasmine --config=src/spec/support/jasmine.json","build":"rm -rf umd && webpack-cli","prepublish":"npm test && npm run build"},"repository":{"type":"git","url":"git://github.com/aceakash/string-similarity.git"},"keywords":["strings","similar","difference","similarity","compare","comparison","degree","match","matching","dice","levenshtein"],"author":{"name":"Akash Kurdekar","email":"npm@kurdekar.com","url":"http://untilfalse.com/"},"license":"ISC","devDependencies":{"jasmine":"^3.6.3","webpack":"^5.4.0","webpack-cli":"^4.2.0"},"gitHead":"e63157a838ad90118364b43d7bfb9dfb2f20ee21","bugs":{"url":"https://github.com/aceakash/string-similarity/issues"},"homepage":"https://github.com/aceakash/string-similarity#readme","_id":"string-similarity@4.0.3","_nodeVersion":"14.15.0","_npmVersion":"6.14.8","dist":{"shasum":"ef52d6fc59c8a0fc93b6307fbbc08cc6e18cde21","size":4428,"noattachment":false,"key":"/string-similarity/-/string-similarity-4.0.3.tgz","tarball":"http://registry.cnpm.dingdandao.com/string-similarity/download/string-similarity-4.0.3.tgz"},"_npmUser":{"name":"aceakash","email":"npm@kurdekar.com"},"directories":{},"maintainers":[{"name":"aceakash","email":"npm@kurdekar.com"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/string-similarity_4.0.3_1604957775393_0.582229324567828"},"_hasShrinkwrap":false,"publish_time":1604957775541,"_cnpm_publish_time":1604957775541,"deprecated":"Package no longer supported. Contact Support at https://www.npmjs.com/support for more info."},"4.0.2":{"name":"string-similarity","version":"4.0.2","description":"Finds degree of similarity between strings, based on Dice's Coefficient, which is mostly better than Levenshtein distance.","main":"src/index.js","scripts":{"test":"jasmine --config=src/spec/support/jasmine.json","build":"rm -rf umd && webpack-cli","prepublish":"npm test && npm run build"},"repository":{"type":"git","url":"git://github.com/aceakash/string-similarity.git"},"keywords":["strings","similar","difference","similarity","compare","comparison","degree","match","matching","dice","levenshtein"],"author":{"name":"Akash Kurdekar","email":"npm@kurdekar.com","url":"http://untilfalse.com/"},"license":"ISC","devDependencies":{"jasmine":"^3.6.1","webpack":"^4.44.1","webpack-cli":"^3.3.12"},"gitHead":"e09e46588a0972850c2ff4e1a66f34a35172b31c","bugs":{"url":"https://github.com/aceakash/string-similarity/issues"},"homepage":"https://github.com/aceakash/string-similarity#readme","_id":"string-similarity@4.0.2","_nodeVersion":"12.17.0","_npmVersion":"6.14.4","dist":{"shasum":"1dc29518d0e92e50509499ce2974368f77bbb1b1","size":4672,"noattachment":false,"key":"/string-similarity/-/string-similarity-4.0.2.tgz","tarball":"http://registry.cnpm.dingdandao.com/string-similarity/download/string-similarity-4.0.2.tgz"},"maintainers":[{"name":"aceakash","email":"npm@kurdekar.com"}],"_npmUser":{"name":"aceakash","email":"npm@kurdekar.com"},"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/string-similarity_4.0.2_1596473269310_0.9202480889869884"},"_hasShrinkwrap":false,"publish_time":1596473270240,"_cnpm_publish_time":1596473270240,"deprecated":"Package no longer supported. Contact Support at https://www.npmjs.com/support for more info."},"4.0.1":{"name":"string-similarity","version":"4.0.1","description":"Finds degree of similarity between strings, based on Dice's Coefficient, which is mostly better than Levenshtein distance.","main":"src/index.js","scripts":{"test":"jasmine --config=src/spec/support/jasmine.json","build":"rm -rf umd && webpack-cli","prepublish":"npm test && npm run build"},"repository":{"type":"git","url":"git://github.com/aceakash/string-similarity.git"},"keywords":["strings","similar","difference","similarity","compare","comparison","degree","match","matching","dice","levenshtein"],"author":{"name":"Akash Kurdekar","email":"npm@kurdekar.com","url":"http://untilfalse.com/"},"license":"ISC","devDependencies":{"jasmine":"^3.4.0","webpack":"^4.41.5","webpack-cli":"^3.3.10"},"gitHead":"68da344556dfdb0659edc561f599a84d8d4bb387","bugs":{"url":"https://github.com/aceakash/string-similarity/issues"},"homepage":"https://github.com/aceakash/string-similarity#readme","_id":"string-similarity@4.0.1","_nodeVersion":"12.14.0","_npmVersion":"6.13.4","dist":{"shasum":"ea7c11f0093cb3088cdcc5eb16cfd90cb54962f7","size":4631,"noattachment":false,"key":"/string-similarity/-/string-similarity-4.0.1.tgz","tarball":"http://registry.cnpm.dingdandao.com/string-similarity/download/string-similarity-4.0.1.tgz"},"maintainers":[{"name":"aceakash","email":"npm@kurdekar.com"}],"_npmUser":{"name":"aceakash","email":"npm@kurdekar.com"},"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/string-similarity_4.0.1_1577993393644_0.88083268714423"},"_hasShrinkwrap":false,"publish_time":1577993393729,"_cnpm_publish_time":1577993393729,"deprecated":"Package no longer supported. Contact Support at https://www.npmjs.com/support for more info."},"4.0.0":{"name":"string-similarity","version":"4.0.0","description":"Finds degree of similarity between strings, based on Dice's Coefficient, which is mostly better than Levenshtein distance.","main":"src/index.js","scripts":{"test":"jasmine --config=src/spec/support/jasmine.json","build":"rm -rf umd && webpack-cli"},"repository":{"type":"git","url":"git://github.com/aceakash/string-similarity.git"},"keywords":["strings","similar","difference","similarity","compare","comparison","degree","match","matching","dice","levenshtein"],"author":{"name":"Akash Kurdekar","email":"npm@kurdekar.com","url":"http://untilfalse.com/"},"license":"ISC","devDependencies":{"jasmine":"^3.4.0","webpack":"^4.41.5","webpack-cli":"^3.3.10"},"gitHead":"68da344556dfdb0659edc561f599a84d8d4bb387","bugs":{"url":"https://github.com/aceakash/string-similarity/issues"},"homepage":"https://github.com/aceakash/string-similarity#readme","_id":"string-similarity@4.0.0","_nodeVersion":"12.14.0","_npmVersion":"6.13.4","dist":{"shasum":"8355606de76ea58ca10a3af9627ddf18e4004544","size":3749,"noattachment":false,"key":"/string-similarity/-/string-similarity-4.0.0.tgz","tarball":"http://registry.cnpm.dingdandao.com/string-similarity/download/string-similarity-4.0.0.tgz"},"maintainers":[{"name":"aceakash","email":"npm@kurdekar.com"}],"_npmUser":{"name":"aceakash","email":"npm@kurdekar.com"},"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/string-similarity_4.0.0_1577992662820_0.8517700050078911"},"_hasShrinkwrap":false,"publish_time":1577992662982,"_cnpm_publish_time":1577992662982,"deprecated":"Package no longer supported. Contact Support at https://www.npmjs.com/support for more info."},"3.0.0":{"name":"string-similarity","version":"3.0.0","description":"Finds degree of similarity between strings, based on Dice's Coefficient, which is mostly better than Levenshtein distance.","main":"compare-strings.js","scripts":{"test":"jasmine"},"repository":{"type":"git","url":"git://github.com/aceakash/string-similarity.git"},"keywords":["strings","similar","difference","similarity","compare","comparison","degree","match","matching","dice","levenshtein"],"author":{"name":"Akash Kurdekar","email":"npm@kurdekar.com","url":"http://untilfalse.com/"},"license":"ISC","devDependencies":{"jasmine":"^3.3.0"},"gitHead":"ccdb537a886d640c1d1fd437414d037ec615562e","bugs":{"url":"https://github.com/aceakash/string-similarity/issues"},"homepage":"https://github.com/aceakash/string-similarity#readme","_id":"string-similarity@3.0.0","_npmVersion":"6.4.0","_nodeVersion":"9.11.1","_npmUser":{"name":"aceakash","email":"npm@kurdekar.com"},"dist":{"shasum":"07b0bc69fae200ad88ceef4983878d03793847c7","size":3556,"noattachment":false,"key":"/string-similarity/-/string-similarity-3.0.0.tgz","tarball":"http://registry.cnpm.dingdandao.com/string-similarity/download/string-similarity-3.0.0.tgz"},"maintainers":[{"name":"aceakash","email":"npm@kurdekar.com"}],"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/string-similarity_3.0.0_1543526686446_0.29322295250940367"},"_hasShrinkwrap":false,"publish_time":1543526686618,"_cnpm_publish_time":1543526686618,"deprecated":"Package no longer supported. Contact Support at https://www.npmjs.com/support for more info."},"2.0.0":{"name":"string-similarity","version":"2.0.0","description":"Finds degree of similarity between strings, based on Dice's Coefficient, which is mostly better than Levenshtein distance.","main":"compare-strings.js","scripts":{"test":"jasmine"},"repository":{"type":"git","url":"git://github.com/aceakash/string-similarity.git"},"keywords":["strings","similar","difference","similarity","compare","comparison","degree","match","matching","dice","levenshtein"],"author":{"name":"Akash Kurdekar","email":"npm@kurdekar.com","url":"http://untilfalse.com/"},"license":"ISC","devDependencies":{"jasmine":"^3.2.0"},"gitHead":"16c348e1016b9d07fbedba1ed934e6a927839d4e","bugs":{"url":"https://github.com/aceakash/string-similarity/issues"},"homepage":"https://github.com/aceakash/string-similarity#readme","_id":"string-similarity@2.0.0","_npmVersion":"6.4.0","_nodeVersion":"9.11.1","_npmUser":{"name":"aceakash","email":"npm@kurdekar.com"},"dist":{"shasum":"c16d8fc7e7c8dce706742c87adc482dbdb7030bb","size":3183,"noattachment":false,"key":"/string-similarity/-/string-similarity-2.0.0.tgz","tarball":"http://registry.cnpm.dingdandao.com/string-similarity/download/string-similarity-2.0.0.tgz"},"maintainers":[{"name":"aceakash","email":"npm@kurdekar.com"}],"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/string-similarity_2.0.0_1538492772711_0.8371973602462419"},"_hasShrinkwrap":false,"publish_time":1538492773039,"_cnpm_publish_time":1538492773039,"deprecated":"Package no longer supported. Contact Support at https://www.npmjs.com/support for more info."},"1.2.2":{"name":"string-similarity","version":"1.2.2","description":"Finds degree of similarity between strings, based on Dice's Coefficient, which is mostly better than Levenshtein distance.","main":"compare-strings.js","scripts":{"test":"jasmine"},"repository":{"type":"git","url":"git://github.com/aceakash/string-similarity.git"},"keywords":["strings","similar","difference","similarity","compare","comparison","degree","match","matching","dice","levenshtein"],"author":{"name":"Akash Kurdekar","email":"npm@kurdekar.com","url":"http://untilfalse.com/"},"license":"ISC","devDependencies":{"jasmine":"^3.2.0"},"dependencies":{"lodash.every":"^4.6.0","lodash.flattendeep":"^4.4.0","lodash.foreach":"^4.5.0","lodash.map":"^4.6.0","lodash.maxby":"^4.6.0"},"gitHead":"b7ea52ea57199927ef31ef0ec1430aa80f5e84f3","bugs":{"url":"https://github.com/aceakash/string-similarity/issues"},"homepage":"https://github.com/aceakash/string-similarity#readme","_id":"string-similarity@1.2.2","_npmVersion":"6.4.0","_nodeVersion":"9.11.1","_npmUser":{"name":"aceakash","email":"npm@kurdekar.com"},"dist":{"shasum":"99b2c20a3c9bbb3903964eae1d89856db3d8db9b","size":2491,"noattachment":false,"key":"/string-similarity/-/string-similarity-1.2.2.tgz","tarball":"http://registry.cnpm.dingdandao.com/string-similarity/download/string-similarity-1.2.2.tgz"},"maintainers":[{"name":"aceakash","email":"npm@kurdekar.com"}],"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/string-similarity_1.2.2_1536745439999_0.9119211862510248"},"_hasShrinkwrap":false,"publish_time":1536745440191,"_cnpm_publish_time":1536745440191,"deprecated":"Package no longer supported. Contact Support at https://www.npmjs.com/support for more info."},"1.2.1":{"name":"string-similarity","version":"1.2.1","description":"Finds degree of similarity between strings, based on Dice's Coefficient, which is mostly better than Levenshtein distance.","main":"compare-strings.js","scripts":{"test":"jasmine"},"repository":{"type":"git","url":"git://github.com/aceakash/string-similarity.git"},"keywords":["strings","similar","difference","similarity","compare","comparison","degree","match","matching","dice","levenshtein"],"files":["compare-strings.js"],"author":{"name":"Akash Kurdekar","email":"npm@kurdekar.com","url":"http://untilfalse.com/"},"license":"ISC","devDependencies":{"jasmine":"^3.2.0"},"dependencies":{"lodash.every":"^4.6.0","lodash.flattendeep":"^4.4.0","lodash.foreach":"^4.5.0","lodash.map":"^4.6.0","lodash.maxby":"^4.6.0"},"gitHead":"53bb90222150032d28f34921100839f61c8e9be0","bugs":{"url":"https://github.com/aceakash/string-similarity/issues"},"homepage":"https://github.com/aceakash/string-similarity#readme","_id":"string-similarity@1.2.1","_npmVersion":"6.4.0","_nodeVersion":"9.11.1","_npmUser":{"name":"aceakash","email":"npm@kurdekar.com"},"dist":{"shasum":"a1e01012e8221587409816c133c28037ea6be2e6","size":2537,"noattachment":false,"key":"/string-similarity/-/string-similarity-1.2.1.tgz","tarball":"http://registry.cnpm.dingdandao.com/string-similarity/download/string-similarity-1.2.1.tgz"},"maintainers":[{"name":"aceakash","email":"npm@kurdekar.com"}],"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/string-similarity_1.2.1_1535060668725_0.9694971070883531"},"_hasShrinkwrap":false,"publish_time":1535060668801,"_cnpm_publish_time":1535060668801,"deprecated":"Package no longer supported. Contact Support at https://www.npmjs.com/support for more info."},"1.2.0":{"name":"string-similarity","version":"1.2.0","description":"Finds degree of similarity between strings, based on Dice's Coefficient, which is mostly better than Levenshtein distance.","main":"compare-strings.js","scripts":{"test":"gulp test"},"repository":{"type":"git","url":"git://github.com/aceakash/string-similarity.git"},"keywords":["strings","similar","difference","similarity","compare","comparison","degree","match","matching","dice","levenshtein"],"author":{"name":"Akash Kurdekar","email":"npm@kurdekar.com","url":"http://untilfalse.com/"},"license":"ISC","devDependencies":{"gulp":"^3.9.1","gulp-jasmine":"^2.3.0","gulp-watch":"^4.3.6"},"dependencies":{"lodash":"^4.13.1"},"gitHead":"d8cae66a2c78d525b13cf766bc6de879d63f79c9","bugs":{"url":"https://github.com/aceakash/string-similarity/issues"},"homepage":"https://github.com/aceakash/string-similarity#readme","_id":"string-similarity@1.2.0","_shasum":"d75153cb383846318b7a39a8d9292bb4db4e9c30","_from":".","_npmVersion":"4.0.2","_nodeVersion":"6.7.0","_npmUser":{"name":"aceakash","email":"npm@kurdekar.com"},"dist":{"shasum":"d75153cb383846318b7a39a8d9292bb4db4e9c30","size":3488,"noattachment":false,"key":"/string-similarity/-/string-similarity-1.2.0.tgz","tarball":"http://registry.cnpm.dingdandao.com/string-similarity/download/string-similarity-1.2.0.tgz"},"maintainers":[{"name":"aceakash","email":"npm@kurdekar.com"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/string-similarity-1.2.0.tgz_1495466172115_0.3841619931627065"},"directories":{},"publish_time":1495466173057,"_hasShrinkwrap":false,"_cnpm_publish_time":1495466173057,"deprecated":"Package no longer supported. Contact Support at https://www.npmjs.com/support for more info."},"1.1.0":{"name":"string-similarity","version":"1.1.0","description":"Finds degree of similarity between strings, based on Dice's Coefficient, which is mostly better than Levenshtein distance.","main":"compare-strings.js","scripts":{"test":"gulp test"},"repository":{"type":"git","url":"git://github.com/aceakash/string-similarity.git"},"keywords":["strings","similar","difference","similarity","compare","comparison","degree","match","matching","dice","levenshtein"],"author":{"name":"Akash Kurdekar","email":"npm@kurdekar.com","url":"http://untilfalse.com/"},"license":"ISC","devDependencies":{"gulp":"^3.9.1","gulp-jasmine":"^2.3.0","gulp-watch":"^4.3.6"},"dependencies":{"lodash":"^4.13.1"},"gitHead":"8352ccafbfdbccebc87946a6a99b06d85f34d15e","bugs":{"url":"https://github.com/aceakash/string-similarity/issues"},"homepage":"https://github.com/aceakash/string-similarity#readme","_id":"string-similarity@1.1.0","_shasum":"3c66498858a465ec7c40c7d81739bbd995904914","_from":".","_npmVersion":"3.8.3","_nodeVersion":"4.2.6","_npmUser":{"name":"aceakash","email":"npm@kurdekar.com"},"dist":{"shasum":"3c66498858a465ec7c40c7d81739bbd995904914","size":3963,"noattachment":false,"key":"/string-similarity/-/string-similarity-1.1.0.tgz","tarball":"http://registry.cnpm.dingdandao.com/string-similarity/download/string-similarity-1.1.0.tgz"},"maintainers":[{"name":"aceakash","email":"npm@kurdekar.com"}],"_npmOperationalInternal":{"host":"packages-16-east.internal.npmjs.com","tmp":"tmp/string-similarity-1.1.0.tgz_1465227395762_0.2918381483759731"},"directories":{},"publish_time":1465227397590,"_cnpm_publish_time":1465227397590,"_hasShrinkwrap":false,"deprecated":"Package no longer supported. Contact Support at https://www.npmjs.com/support for more info."},"1.0.0":{"name":"string-similarity","version":"1.0.0","description":"Finds degree of similarity between strings, based on Dice's Coefficient, which is mostly better than Levenshtein distance.","main":"compare-strings.js","scripts":{"test":"gulp test"},"repository":{"type":"git","url":"git://github.com/aceakash/string-similarity.git"},"keywords":["strings","similar","difference","similarity","compare","comparison","degree","match","matching","dice","levenshtein"],"author":{"name":"Akash Kurdekar","email":"npm@kurdekar.com","url":"http://untilfalse.com/"},"license":"ISC","devDependencies":{"gulp":"^3.8.10","gulp-jasmine":"^1.0.1","gulp-watch":"^2.0.0"},"dependencies":{"lodash":"^2.4.1"},"gitHead":"42d3430251c9658c0fe9b2b24d9016ef9744693e","bugs":{"url":"https://github.com/aceakash/string-similarity/issues"},"homepage":"https://github.com/aceakash/string-similarity","_id":"string-similarity@1.0.0","_shasum":"cf316603aec15729714582f5ecf5c5683ec82033","_from":"./","_npmVersion":"1.4.28","_npmUser":{"name":"aceakash","email":"npm@kurdekar.com"},"maintainers":[{"name":"aceakash","email":"npm@kurdekar.com"}],"dist":{"shasum":"cf316603aec15729714582f5ecf5c5683ec82033","size":3064,"noattachment":false,"key":"/string-similarity/-/string-similarity-1.0.0.tgz","tarball":"http://registry.cnpm.dingdandao.com/string-similarity/download/string-similarity-1.0.0.tgz"},"directories":{},"publish_time":1417048122024,"_cnpm_publish_time":1417048122024,"_hasShrinkwrap":false,"deprecated":"Package no longer supported. Contact Support at https://www.npmjs.com/support for more info."}},"readme":"# string-similarity\n\nFinds degree of similarity between two strings, based on [Dice's Coefficient](http://en.wikipedia.org/wiki/S%C3%B8rensen%E2%80%93Dice_coefficient), which is mostly better than [Levenshtein distance](http://en.wikipedia.org/wiki/Levenshtein_distance).\n\n## Table of Contents\n\n- [string-similarity](#string-similarity)\n - [Table of Contents](#table-of-contents)\n - [Usage](#usage)\n - [For Node.js](#for-nodejs)\n - [For browser apps](#for-browser-apps)\n - [API](#api)\n - [compareTwoStrings(string1, string2)](#comparetwostringsstring1-string2)\n - [Arguments](#arguments)\n - [Returns](#returns)\n - [Examples](#examples)\n - [findBestMatch(mainString, targetStrings)](#findbestmatchmainstring-targetstrings)\n - [Arguments](#arguments-1)\n - [Returns](#returns-1)\n - [Examples](#examples-1)\n - [Release Notes](#release-notes)\n - [2.0.0](#200)\n - [3.0.0](#300)\n - [3.0.1](#301)\n - [4.0.1](#401)\n - [4.0.2](#402)\n - [4.0.3](#403)\n\n## Usage\n\n#### For Node.js\n\nInstall using:\n\n```shell\nnpm install string-similarity --save\n```\n\nIn your code:\n\n```javascript\nvar stringSimilarity = require(\"string-similarity\");\n\nvar similarity = stringSimilarity.compareTwoStrings(\"healed\", \"sealed\");\n\nvar matches = stringSimilarity.findBestMatch(\"healed\", [\n \"edward\",\n \"sealed\",\n \"theatre\",\n]);\n```\n\n#### For browser apps\n\nInclude `` to get the latest version.\n\nOr `` to get a specific version (4.0.1) in this case.\n\nThis exposes a global variable called `stringSimilarity` which you can start using.\n\n```\n\n```\n\n(The package is exposed as UMD, so you can consume it as such)\n\n## API\n\nThe package contains two methods:\n\n### compareTwoStrings(string1, string2)\n\nReturns a fraction between 0 and 1, which indicates the degree of similarity between the two strings. 0 indicates completely different strings, 1 indicates identical strings. The comparison is case-sensitive.\n\n##### Arguments\n\n1. string1 (string): The first string\n2. string2 (string): The second string\n\nOrder does not make a difference.\n\n##### Returns\n\n(number): A fraction from 0 to 1, both inclusive. Higher number indicates more similarity.\n\n##### Examples\n\n```javascript\nstringSimilarity.compareTwoStrings(\"healed\", \"sealed\");\n// → 0.8\n\nstringSimilarity.compareTwoStrings(\n \"Olive-green table for sale, in extremely good condition.\",\n \"For sale: table in very good condition, olive green in colour.\"\n);\n// → 0.6060606060606061\n\nstringSimilarity.compareTwoStrings(\n \"Olive-green table for sale, in extremely good condition.\",\n \"For sale: green Subaru Impreza, 210,000 miles\"\n);\n// → 0.2558139534883721\n\nstringSimilarity.compareTwoStrings(\n \"Olive-green table for sale, in extremely good condition.\",\n \"Wanted: mountain bike with at least 21 gears.\"\n);\n// → 0.1411764705882353\n```\n\n### findBestMatch(mainString, targetStrings)\n\nCompares `mainString` against each string in `targetStrings`.\n\n##### Arguments\n\n1. mainString (string): The string to match each target string against.\n2. targetStrings (Array): Each string in this array will be matched against the main string.\n\n##### Returns\n\n(Object): An object with a `ratings` property, which gives a similarity rating for each target string, a `bestMatch` property, which specifies which target string was most similar to the main string, and a `bestMatchIndex` property, which specifies the index of the bestMatch in the targetStrings array.\n\n##### Examples\n\n```javascript\nstringSimilarity.findBestMatch('Olive-green table for sale, in extremely good condition.', [\n 'For sale: green Subaru Impreza, 210,000 miles',\n 'For sale: table in very good condition, olive green in colour.',\n 'Wanted: mountain bike with at least 21 gears.'\n]);\n// →\n{ ratings:\n [ { target: 'For sale: green Subaru Impreza, 210,000 miles',\n rating: 0.2558139534883721 },\n { target: 'For sale: table in very good condition, olive green in colour.',\n rating: 0.6060606060606061 },\n { target: 'Wanted: mountain bike with at least 21 gears.',\n rating: 0.1411764705882353 } ],\n bestMatch:\n { target: 'For sale: table in very good condition, olive green in colour.',\n rating: 0.6060606060606061 },\n bestMatchIndex: 1\n}\n```\n\n## Release Notes\n\n### 2.0.0\n\n- Removed production dependencies\n- Updated to ES6 (this breaks backward-compatibility for pre-ES6 apps)\n\n### 3.0.0\n\n- Performance improvement for `compareTwoStrings(..)`: now O(n) instead of O(n^2)\n- The algorithm has been tweaked slightly to disregard spaces and word boundaries. This will change the rating values slightly but not enough to make a significant difference\n- Adding a `bestMatchIndex` to the results for `findBestMatch(..)` to point to the best match in the supplied `targetStrings` array\n\n### 3.0.1\n\n- Refactoring: removed unused functions; used `substring` instead of `substr`\n- Updated dependencies\n\n### 4.0.1\n\n- Distributing as an UMD build to be used in browsers.\n\n### 4.0.2\n\n- Update dependencies to latest versions.\n\n### 4.0.3\n\n- Make compatible with IE and ES5. Also, update deps. (see [PR56](https://github.com/aceakash/string-similarity/pull/56))\n\n### 4.0.4\n\n- Simplify some conditional statements. Also, update deps. (see [PR50](https://github.com/aceakash/string-similarity/pull/50))\n\n\n[](https://snyk.io/test/github/aceakash/string-similarity)\n","_attachments":{},"homepage":"https://github.com/aceakash/string-similarity#readme","bugs":{"url":"https://github.com/aceakash/string-similarity/issues"},"license":"ISC"}