Naturallanguageprocessing, String Matching, R, Jaro Winkler, Levenshtein Distance.
is intuitive for us human to detect that Hollister Building should match with Hollister Hall and adjust accordingly, but as the algorithm goes through the two lists to find a “best match,” defined as the building in the second list whose name has the highest Levenshtein score with the base name, it