Java实现相似度匹配算法

版权声明：乘梦碧溪QQ:2838635235 https://blog.csdn.net/zy13651953784/article/details/84929536

/** 
 * 相似度匹配算法 
 * （据说）由俄国人Vladimir Levenshtein在1965年发明 
 * 原理：返回将第一个字符串转换(删除、插入、替换)成第二个字符串的编辑次数。 
 * 次数越少，意味着字符串相似度越高 
 */ 

	public class Test {
		 
		public static void main(String[] args) {
	 
			String Str_1="abcdefghi5klmuvwxyz";
			String Str_2="akcdefghijkl2uvwxz";
			//length
			int Length1=Str_1.length();
			int Length2=Str_2.length();
			
			int Distance=0;
			if (Length1==0) {
				Distance=Length2;
			}
			if(Length2==0)
			{
				Distance=Length1;
			}
			if(Length1!=0&&Length2!=0){
				int[][] Distance_Matrix=new int[Length1+1][Length2+1];
				//编号
				int Bianhao=0;
				for (int i = 0; i <= Length1; i++) {
						Distance_Matrix[i][0]=Bianhao;
						Bianhao++;
				}
				Bianhao=0;
				for (int i = 0; i <=Length2; i++) {
					Distance_Matrix[0][i]=Bianhao;
					Bianhao++;
				}
				
				
				char[] Str_1_CharArray=Str_1.toCharArray();
				char[] Str_2_CharArray=Str_2.toCharArray();
				
				
				for (int i = 1; i <= Length1; i++) {
					for(int j=1;j<=Length2;j++){
						if(Str_1_CharArray[i-1]==Str_2_CharArray[j-1]){
							Distance=0;
						}	
						else{
							Distance=1;
						}
							
							int Temp1=Distance_Matrix[i-1][j]+1;
							int Temp2=Distance_Matrix[i][j-1]+1;
							int Temp3=Distance_Matrix[i-1][j-1]+Distance;
							
							Distance_Matrix[i][j]=Temp1>Temp2?Temp2:Temp1;
							Distance_Matrix[i][j]=Distance_Matrix[i][j]>Temp3?Temp3:Distance_Matrix[i][j];
						
					}
					
				}
				
				Distance=Distance_Matrix[Length1][Length2];
			}
			
			double Aerfa=1-1.0*Distance/(Length1>Length2?Length1:Length2);
			System.out.println(Aerfa);
		}
	 
	}