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 |
| Author: | Dan S. Reznik |
| Maintainer: | Dan S. Reznik <dreznik at gmail.com> |
| 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: clustringr_1.0.zip, r-release: clustringr_1.0.zip, r-oldrel: clustringr_1.0.zip |
| macOS binaries: | r-release: clustringr_1.0.tgz, r-oldrel: clustringr_1.0.tgz |
Please use the canonical form https://CRAN.R-project.org/package=clustringr to link to this page.