String levenshtein Distance - Node.js String

Node.js examples for String:Algorithm

  1. HOME
  2. Node.js
  3. String
  4. Algorithm

Description

String levenshtein Distance

Demo Code


// http://ejohn.org/blog/fast-javascript-maxmin/
Array.max = function(arr) {
    return Math.max.apply(Math, arr);
};

// http://stackoverflow.com/a/2648463/787842
String.prototype.format = String.prototype.f = function() {
    var s = this,
    i = arguments.length;/* w  ww  . jav  a 2  s. co m*/
    while (i--) { s = s.replace(new RegExp('\\{' + i + '\\}', 'gm'), arguments[i]); }
    return s;
};

// http://stackoverflow.com/a/4825873/787842
Array.prototype.remove = function(elem) {
    var match = -1;
    while( (match = this.indexOf(elem)) > -1 ) {
        this.splice(match, 1);
    }
};


// taken from: http://rosettacode.org/wiki/Levenshtein_distance#JavaScript
function levenshteinDist(str1, str2) {
    var m = str1.length,
    n = str2.length,
    d = [],
    i, j;
    if (!m) { return n; }
    if (!n) { return m; }
    for (i = 0; i <= m; i++) { d[i] = [i]; }
    for (j = 0; j <= n; j++) { d[0][j] = j; }
    for (j = 1; j <= n; j++) {
        for (i = 1; i <= m; i++) {
            if (str1[i-1] === str2[j-1]) { d[i][j] = d[i - 1][j - 1]; }
            else { d[i][j] = Math.min(d[i-1][j], d[i][j-1], d[i-1][j-1]) + 1; }
        }
    }
    return d[m][n];
};

Related Tutorials