Installation
About
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.
Key Metrics
Downloads
Yesterday | 3 -25% |
Last 7 days | 49 +7% |
Last 30 days | 185 +22% |
Last 90 days | 589 -22% |
Last 365 days | 2.247 -25% |