clustringr: Cluster Strings by Edit-Distance

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.

Version: 1.0
Depends: R (≥ 3.1)
Imports: magrittr, dplyr, stringi, stringr, stringdist, igraph, assertthat, forcats, rlang, tidygraph, ggraph, ggplot2
Published: 2019-03-30
DOI: 10.32614/CRAN.package.clustringr
Author: Dan S. Reznik
Maintainer: Dan S. Reznik <dreznik at>
License: MIT + file LICENSE
NeedsCompilation: no
Materials: README
CRAN checks: clustringr results


Reference manual: clustringr.pdf


Package source: clustringr_1.0.tar.gz
Windows binaries: r-devel:, r-release:, r-oldrel:
macOS binaries: r-release (arm64): clustringr_1.0.tgz, r-oldrel (arm64): clustringr_1.0.tgz, r-release (x86_64): clustringr_1.0.tgz, r-oldrel (x86_64): clustringr_1.0.tgz


Please use the canonical form to link to this page.