java最大最小距离算法缺点_最小编辑距离算法JAVA实现

这是根据北大詹卫东老师的PPT，实现的编辑距离算法，如有错误，欢迎指出，我会做出及时修改。

package test; //最小编辑距离的算法动态规划实现 public class Min_Edit_Distance { private static int cost = 0; public static int minEdit_distance(String source, String target) { final int n = target.length(); final int m = source.length(); if(m == 0 )return m; if(n == 0)return n; int[][] distance_matrix = new int[m+1][n+1]; distance_matrix[0][0] = 0; for(int i=0;i <= n;i++){ distance_matrix[0][i] = i; } for(int j=0;j <= m;j++){ distance_matrix[j][0] = j; } for(int i=1;i <= m;i++){ char ci = source.charAt(i - 1);  for(int j=1;j <= n;j++){ char cj = target.charAt(j - 1); if(ci == cj){ cost = 0; }else{ cost = 2; } distance_matrix[i][j] = Math.min(distance_matrix[i-1][j-1]+cost, Math.min(distance_matrix[i-1][j]+1, distance_matrix[i][j-1]+1)); } } return distance_matrix[m][n]; } public static void main(String[] args){ String source = "china"; String target = "chino"; System.out.println("最小编辑距离是："+minEdit_distance(source,target)); } }