Naturallanguageprocessing, String Matching, R, Jaro Winkler, Levenshtein Distance.
levenshtein_similarity = levenshteinSim(string_a, string_b) Levenshtein might prove too simplistic, as it is agnostic of the order of the characters in the strings. The example below demonstrates this weakness: the first itemset has “Hollister Building”, and the second set has “Hollister Hall” and