public
static
void main(String[] args) {
String str1 =
"汗1滴禾下土"
;
String str2 =
"汗滴禾下土"
;
levenshtein(str1,str2);
str1 =
"汗滴禾下土"
;
str2 =
"汗滴禾下土"
;
levenshtein(str1,str2);
str1 =
"锄禾日当午"
;
str2 =
"汗滴禾下土"
;
levenshtein(str1,str2);
str1 =
"我觉得锄禾日当午"
;
str2 =
"锄禾日是sag"
;
levenshtein(str1,str2);
str1 =
"我最帅asdasd"
;
str2 =
"最帅asdasdqeqwe"
;
levenshtein(str1,str2);
}
public
static
void 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);
}
}
float similarity =1 - (float) dif[len1][len2] / Math.max(str1.length(), str2.length());
System.out.println(
"字符串【"
+str1+
"】与【"
+str2+
"】的相似度是:"
+similarity);
System.out.println();
}
private
static
int min(int... is) {
int min = Integer.MAX_VALUE;
for
(int i : is) {
if
(min > i) {
min = i;
}
}
return
min;
}