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.
Versions across snapshots
| Version | Repository | File | Size |
|---|---|---|---|
1.0 |
rolling linux/jammy R-4.5 | clustringr_1.0.tar.gz |
430.5 KiB |
1.0 |
rolling linux/noble R-4.5 | clustringr_1.0.tar.gz |
430.4 KiB |
1.0 |
rolling source/ R- | clustringr_1.0.tar.gz |
407.7 KiB |
1.0 |
latest linux/jammy R-4.5 | clustringr_1.0.tar.gz |
430.5 KiB |
1.0 |
latest linux/noble R-4.5 | clustringr_1.0.tar.gz |
430.4 KiB |
1.0 |
latest source/ R- | clustringr_1.0.tar.gz |
407.7 KiB |
1.0 |
2026-04-26 source/ R- | clustringr_1.0.tar.gz |
407.7 KiB |
1.0 |
2026-04-23 source/ R- | clustringr_1.0.tar.gz |
407.7 KiB |
1.0 |
2026-04-09 windows/windows R-4.5 | clustringr_1.0.zip |
434.3 KiB |
1.0 |
2025-04-20 source/ R- | clustringr_1.0.tar.gz |
407.7 KiB |