fix(string): similarity

Author: SamuelScheit

src/String.ts

@@ -14,39 +14,38 @@ define(String.prototype, {
 	replaceAll: function (find: string, replace: string) {
 		return this.replace(new RegExp(escapeRegExp(find), "g"), replace);
 	},
-	similarity: function (second: string) {
-		const first = this.replace(/\s+/g, "");
-		second = second.replace(/\s+/g, "");
-		if (!first.length && !second.length) return 1; // if both are empty strings
-		if (!first.length || !second.length) return 0; // if only one is empty string
-		if (first === second) return 1; // identical
-		if (first.length === 1 && second.length === 1) return 0; // both are 1-letter strings
-		if (first.length < 2 || second.length < 2) return 0; // if either is a 1-letter string
-		const firstBigrams = new Map();
-		const lowBigrams = new Map();
-		for (let i = 0; i < first.length - 1; i++) {
-			const bigram = first.substring(i, i + 2);
-			const count = firstBigrams.has(bigram) ? firstBigrams.get(bigram) + 1 : 1;
-			const countLow = lowBigrams.has(bigram.toLowerCase()) ? lowBigrams.get(bigram.toLowerCase()) + 1 : 1;
+	similarity: function (s2: string) {
+		var s1 = this.toLowerCase();
+		s2 = s2.toLowerCase();
 
-			lowBigrams.set(bigram.toLowerCase(), countLow);
-			firstBigrams.set(bigram, count);
+		if (s1.length < s2.length) {
+			s1 = s2;
+			s2 = this;
 		}
-		let intersectionSize = 0;
-		for (let i = 0; i < second.length - 1; i++) {
-			const bigram = second.substring(i, i + 2);
-			const count = firstBigrams.has(bigram) ? firstBigrams.get(bigram) : 0;
-			const countLow = firstBigrams.has(bigram.toLowerCase()) ? firstBigrams.get(bigram.toLowerCase()) : 0;
-			if (count > 0) {
-				firstBigrams.set(bigram, count - 1);
-				intersectionSize++;
-			}
-			if (countLow > 0) {
-				firstBigrams.set(bigram.toLowerCase(), countLow - 1);
-				intersectionSize += 0.9;
+		var longerLength = s1.length;
+		if (longerLength == 0) {
+			return 1.0;
+		}
+
+		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 (2.0 * intersectionSize) / (first.length + second.length - 2);
+
+		return (longerLength - costs[s2.length]) / parseFloat(longerLength);
 	},
 	join: function (iterate: string[]) {
 		if (typeof iterate === "string") return iterate;