Cluster Strings by Edit-Distance R package clustringr version 1.0 Returns an edit-distance based clusterization of an input vector of strings. Each cluster will contain a set of strings w/ small mutual edit-distance (e.g., Levenshtein, optimum-sequence-alignment, Damerau-Levenshtein), as computed by stringdist::stringdist(). The set of all mutual edit-distances is then used by graph algorithms (from package 'igraph') to single out subsets of high connectivity. Software Depends: R (>= 3.1) Imports: magrittr, dplyr, stringi, stringr, stringdist, igraph, assertthat, forcats, rlang, tidygraph, ggraph, ggplot2 Dan S. Reznik <dreznik@gmail.com> Comprehensive R Archive Network (CRAN) Dan S. Reznik MIT + file LICENSE (https://CRAN.R-project.org/package=clustringr/LICENSE) 2019-03-30 application/tgz https://CRAN.R-project.org/package=clustringr doi:10.32614/CRAN.package.clustringr