Groovy字符串匹配90%(忽略字母大小写)

Question

我需要编写一个Groovy函数来检查两个给定的字符串是否匹配至少90%.我只是想知道是否有人知道我可以在Grails项目中使用的已经存在的这种实用方法.我还没有真正编写过这个方法,但理想情况下这就是它的工作方式:

def doStringsMatch(String str1, String str2) {
    if (str1 and str2 match at least 90% or
        str1 appears in str2 somewhere or
        str2 appears in str1 somewhere)
        return true
    else
        return false
}

谢谢

Answer 1

这是Levenshtein距离的常规实现,基本上它返回两个字符串看起来相似的百分比. 0意味着它们完全不同,1意味着它们完全相同.此实现不区分大小写.

  private double similarity(String s1, String s2) {
    if (s1.length() < s2.length()) { // s1 should always be bigger
        String swap = s1; s1 = s2; s2 = swap;
    }
    int bigLen = s1.length();
    if (bigLen == 0) { return 1.0; /* both strings are zero length */ }
    return (bigLen - computeEditDistance(s1, s2)) / (double) bigLen;
  }

  private int computeEditDistance(String s1, String s2) {
    s1 = s1.toLowerCase();
    s2 = s2.toLowerCase();

    int[] costs = new int[s2.length() + 1];
    for (int i = 0; i <= s1.length(); i++) {
        int lastValue = i;
        for (int j = 0; j <= s2.length(); j++) {
            if (i == 0)
                costs[j] = j;
            else {
                if (j > 0) {
                    int newValue = costs[j - 1];
                    if (s1.charAt(i - 1) != s2.charAt(j - 1))
                        newValue = Math.min(Math.min(newValue, lastValue),
                                costs[j]) + 1;
                    costs[j - 1] = lastValue;
                    lastValue = newValue;
                }
            }
        }
        if (i > 0)
            costs[s2.length()] = lastValue;
    }
    return costs[s2.length()];
  }