问题描述
我想在 String [] 中查找 String ，以获得查询的最佳匹配。我听说过Levenshtein Distance。但我无法确定是否需要它。
I want to look up a String in a String[] for the best match of the query. I have heard of Levenshtein Distance. But I cannot determine if I need it or not.
假设我有字符串查询=示例和
String[] arrayStr = new String[] {"The Examples String", "The Example String", "Example", "Examples String", "Example String", "Examplestring"};
现在，我想获得示例来自 String [] 作为最佳匹配。
Now, I want to get the Example from the String[] as the best match.
那么，我需要Levenshtein距离吗？
So, Do I need Levenshtein Distance to do it?
或者，如果有人能指出我对Levenshtein Distance for Java的快速实施，那就太棒了。我想检查它是否适用于我拥有的所有字符串。 （基本上我有大约10k个字符串来匹配10k数组。）
Alternatively, If someone can point me a fast implementation of Levenshtein Distance for Java, it would be great. I would like to check if it works with all the kind of strings that I have. (Basically I have around 10k strings to match from 10k arrays.)
推荐答案
是的，Levenshtein Distance是这个的goto算法。
您可以在
找到多种语言的实现，包括Java，
Yes, Levenshtein Distance is the goto algorithm for this.You can find implementations in many languages, including Java, athttp://rosettacode.org/wiki/Levenshtein_distance
这篇关于最短的Levenshtein距离？我需要它吗？的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持！