Naturallanguageprocessing, String Matching, R, Jaro Winkler, Levenshtein Distance.
similarity is calculated as: jaro = [m/nchar(s1) + m/nchar(s2) + (m - t/2)/m]/3 m is the number of matching characters t is the number of edits that need to be made for the trings to match nchar(s1) is the length of the first string nchar(s2) is the length of the second string Winkler’s adjustment