compute Levenshtein Distance between two String values - Android java.lang

Android examples for java.lang:String Similar

  1. HOME
  2. Android
  3. java.lang
  4. String Similar

Description

compute Levenshtein Distance between two String values

Demo Code

import android.text.TextUtils;
import java.util.ArrayList;
import java.util.List;

public class Main{

    public static int computeLevenshteinDistance(CharSequence str1,
            CharSequence str2) {/*from w  w  w  . ja  va2s  . co m*/

        int commonPrefixLength = findCommonPrefixLength(str1, str2);

        if (commonPrefixLength == str1.length()
                && commonPrefixLength == str2.length()) {
            return 0; // same exact string
        }

        int commonSuffixLength = findCommonSuffixLength(str1, str2,
                commonPrefixLength);

        str1 = str1.subSequence(commonPrefixLength, str1.length()
                - commonSuffixLength);
        str2 = str2.subSequence(commonPrefixLength, str2.length()
                - commonSuffixLength);

        int[][] distance = new int[str1.length() + 1][str2.length() + 1];

        for (int i = 0; i <= str1.length(); i++) {
            distance[i][0] = i;
        }
        for (int j = 0; j <= str2.length(); j++) {
            distance[0][j] = j;
        }

        for (int i = 1; i <= str1.length(); i++) {
            for (int j = 1; j <= str2.length(); j++) {
                distance[i][j] = minimum(
                        distance[i - 1][j] + 1,
                        distance[i][j - 1] + 1,
                        distance[i - 1][j - 1]
                                + ((str1.charAt(i - 1) == str2
                                        .charAt(j - 1)) ? 0 : 1));
            }
        }

        int dist = distance[str1.length()][str2.length()];

        return dist;
    }

}

Related Tutorials