|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||
java.lang.Objectit.unitn.disi.smatch.matchers.element.string.EditDistanceOptimized
public class EditDistanceOptimized
Optimized edit distance. http://www.merriampark.com/ldjava.htm Levenshtein Distance Algorithm: Java Implementation by Chas Emerick
| Constructor Summary | |
|---|---|
EditDistanceOptimized()
|
|
| Method Summary | |
|---|---|
static int |
getLevenshteinDistance(java.lang.String s,
java.lang.String t)
|
char |
match(java.lang.String str1,
java.lang.String str2)
Returns a relation between source and target strings. |
| Methods inherited from class java.lang.Object |
|---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
| Constructor Detail |
|---|
public EditDistanceOptimized()
| Method Detail |
|---|
public char match(java.lang.String str1,
java.lang.String str2)
IStringBasedElementLevelSemanticMatcher
match in interface IStringBasedElementLevelSemanticMatcherstr1 - source stringstr2 - target string
public static int getLevenshteinDistance(java.lang.String s,
java.lang.String t)
|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||