/** * 類似度 * @param str1 * @param str2 */ public static float levenshtein(String str1,String str2) { int len1 = str1.length(); int len2 = str2.length(); int[][] dif = new int[len1 + 1][len2 + 1]; for (int a = 0; a <= len1; a++) { dif[a][0] = a; } for (int a = 0; a <= len2; a++) { dif[0][a] = a; } int temp; for (int i = 1; i <= len1; i++) { for (int j = 1; j <= len2; j++) { if (str1.charAt(i - 1) == str2.charAt(j - 1)) { temp = 0; } else { temp = 1; } dif[i][j] = min(dif[i - 1][j - 1] + temp, dif[i][j - 1] + 1, dif[i - 1][j] + 1); } } logger.debug("字符串[{}]與[{}]比較",str1,str2); logger.debug("差別步驟:"+dif[len1][len2]); float similarity =1 - (float) dif[len1][len2] / Math.max(str1.length(), str2.length()); logger.debug("類似度:"+similarity); return similarity; } private static int min(int... is) { int min = Integer.MAX_VALUE; for (int i : is) { if (min > i) { min = i; } } return min; }