Naturallanguageprocessing, String Matching, R, Jaro Winkler, Levenshtein Distance.
adds: jw = dj + prefix_length * p * (1 - dj) where p is a constant scaling factor to put more weight on earlier matches, and prefix_length is the length of the first portion of the string to be considered for scaling (i.e., length of the “prefix”). In both Winkler’s work and the R package