.net - Are there any string comparison alogrithms out there that are "better" than Levenshtein Distance? -
i have been using project working on, of results aren't choose. example:
when "date" compared to
- "state" has lev distance of 2
- "today's date" has lev distance of 9
this expect algorithm of course, i'm curious if knows of out there give closer match compared strings have exact match of source string (date)? meaning "today's date" have higher ranking because has "date" in it.
bonus points if can find .net library implements this.
i think it's meant tokenize word before employing levenshtein. alternative there jaro-winker distance too.
there's .net library simmetrics seems cover a few alternatives.
Comments
Post a Comment