Last active
November 26, 2018 01:07
-
-
Save googlicius/a68a05473c3c73a7fe0e7d45872f8358 to your computer and use it in GitHub Desktop.
Function to compare 2 string by percentage.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
/** | |
* Function to compare 2 string by percentage. | |
* | |
* @see https://stackoverflow.com/a/36566052/1427748 | |
* @param {string} s1 | |
* @param {string} s2 | |
*/ | |
const similarity = (s1, s2) => { | |
function editDistance(s1, s2) { | |
s1 = s1.toLowerCase(); | |
s2 = s2.toLowerCase(); | |
var costs = new Array(); | |
for (var i = 0; i <= s1.length; i++) { | |
var lastValue = i; | |
for (var j = 0; j <= s2.length; j++) { | |
if (i == 0) | |
costs[j] = j; | |
else { | |
if (j > 0) { | |
var newValue = costs[j - 1]; | |
if (s1.charAt(i - 1) != s2.charAt(j - 1)) | |
newValue = Math.min(Math.min(newValue, lastValue), | |
costs[j]) + 1; | |
costs[j - 1] = lastValue; | |
lastValue = newValue; | |
} | |
} | |
} | |
if (i > 0) | |
costs[s2.length] = lastValue; | |
} | |
return costs[s2.length]; | |
} | |
var longer = s1; | |
var shorter = s2; | |
if (s1.length < s2.length) { | |
longer = s2; | |
shorter = s1; | |
} | |
var longerLength = longer.length; | |
if (longerLength == 0) { | |
return 1.0; | |
} | |
return (longerLength - editDistance(longer, shorter)) / parseFloat(longerLength); | |
} |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Great script! I used it to match names between 2 lists, credited you for the find in the Readme and in the function definition.
https://github.com/maskSnorkelFins/listCompare