The hardware and bandwidth for this mirror is donated by dogado GmbH, the Webhosting and Full Service-Cloud Provider. Check out our Wordpress Tutorial.
If you wish to report a bug, or if you are interested in having us mirror your free-software or open-source project, please feel free to contact us at mirror[@]dogado.de.

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 gmail.com>
License: MIT + file LICENSE
NeedsCompilation: no
Materials: README
CRAN checks: clustringr results

Documentation:

Reference manual: clustringr.pdf

Downloads:

Package source: clustringr_1.0.tar.gz
Windows binaries: r-devel: clustringr_1.0.zip, r-release: clustringr_1.0.zip, r-oldrel: clustringr_1.0.zip
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

Linking:

Please use the canonical form https://CRAN.R-project.org/package=clustringr to link to this page.

These binaries (installable software) and packages are in development.
They may not be fully stable and should be used with caution. We make no claims about them.
Health stats visible at Monitor.