Naturallanguageprocessing, String Matching, R, Jaro Winkler, Levenshtein Distance.
max(unlist(sim_scores)))] # take the item name corresponding to the highest similarity score } matches$absolute = ifelse(matches[,1] == matches$matched, TRUE, FALSE) return(matches) } ############### ### Example ### ############### # Initiate two datasets, each having a column with building names: