Navigation Menu

Skip to content

Instantly share code, notes, and snippets.

Show Gist options
  • Star 0 You must be signed in to star a gist
  • Fork 0 You must be signed in to fork a gist
  • Save mqamarmunir/9921cdd6724a5ff6eaf0c177f8566cf5 to your computer and use it in GitHub Desktop.
Save mqamarmunir/9921cdd6724a5ff6eaf0c177f8566cf5 to your computer and use it in GitHub Desktop.
Measure distance between the strings using levenstein distance algorithm
String.prototype.levenstein = function(string) {
var a = this, b = string + "", m = [], i, j, min = Math.min;
if (!(a && b)) return (b || a).length;
for (i = 0; i <= b.length; m[i] = [i++]);
for (j = 0; j <= a.length; m[0][j] = j++);
for (i = 1; i <= b.length; i++) {
for (j = 1; j <= a.length; j++) {
m[i][j] = b.charAt(i - 1) == a.charAt(j - 1)
? m[i - 1][j - 1]
: m[i][j] = min(
m[i - 1][j - 1] + 1,
min(m[i][j - 1] + 1, m[i - 1 ][j] + 1))
}
}
return m[b.length][a.length];
}
var arrayofstrings=["1 week","2 weeks","3 weeks","4 weeks"];
var stringtocheck ="2weeks";
var mini=stringtocheck.length;
var maxdistanceallowed=4;
var distance;
var mindistanceindex;
for(var i=0;i<arrayofstrings.length;i++)
{
distance=arrayofstrings[i].levenstein(stringtocheck);
if(distance<mini && distance<maxdistanceallowed)
{
mini=distance;
mindistanceindex=i;
}
}
//console.log(mindistanceindex!=undefined);
if(mindistanceindex!=undefined)
console.log(arrayofstrings[mindistanceindex]);
else
console.log(stringtocheck);
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment