使用JavaScript对用户响应进行评分（比较两个数组）。

var correctanswer = [\"The\",\"quick\",\"brown\",\"fox\",\"jumped\",\"over\",\"the\",\"lazy\",\"dog\"];
var useranswer =    [\"The\",\"brown\",\"fox\",\"jumped\",\"up\",\"and\",\"over\",\"the\",\"really\",\"lazy\",\"cat\"];

console.log(calculate_levenshtein_distance(correctanswer, useranswer));

function calculate_levenshtein_distance(s, t) {
  var m = s.length + 1, n = t.length + 1;
  var i, j;

  // for all i and j, d[i,j] will hold the Levenshtein distance between
  // the first i words of s and the first j words of t;
  // note that d has (m+1)x(n+1) values
  var d = [];

  for (i = 0; i < m; i++) {
    d[i] = [i]; // the distance of any first array to an empty second array
  }
  for (j = 0; j < n; j++) {
    d[0][j] = j; // the distance of any second array to an empty first array
  }

  for (j = 1; j < n; j++) {
    for (i = 1; i < m; i++) {
      if (s[i - 1] === t[j - 1]) {
        d[i][j] = d[i-1][j-1];           // no operation required
      } else {
        d[i][j] = Math.min(
                    d[i - 1][j] + 1,     // a deletion
                    d[i][j - 1] + 1,     // an insertion
                    d[i - 1][j - 1] + 1  // a substitution
                  );
      }
    }
  }

  return d[m - 1][n - 1];
}

lazy

function counterrors(a, b) {
    var max = Math.max(a.length, b.length);
    var min = Math.min(a.length, b.length);
    var count = 0;
    for (var i = 0; i < min; i+=1) {
        if (a[i] !== b[i]) {
            count += 1;
        }
    }
    return count + max - min;  // max - min for any extra things that don\'t match
}
var correctanswer = [\"The\", \"quick\", \"brown\", \"fox\", \"jumped\", \"over\", \"the\", \"lazy\", \"dog\"];
var useranswer = [\"The\", \"brown\", \"fox\", \"jumped\", \"up\", \"and\", \"over\", \"the\", \"really\", \"lazy\", \"cat\"];
alert(counterrors(correctanswer, useranswer));