clustringr

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.

Last 30 days

This package has been downloaded 177 times in the last 30 days. Enough downloads to make a small wave in the niche community. The curiosity is spreading! The following heatmap shows the distribution of downloads per day. Yesterday, it was downloaded 7 times.

The following line graph shows the downloads per day. You can hover over the graph to see the exact number of downloads per day.

Last 365 days

This package has been downloaded 2,075 times in the last 365 days. Now we’re talking! This work is officially 'heard of in academic circles', just like those wild research papers on synthetic bananas. The day with the most downloads was Sep 11, 2024 with 22 downloads.

The following line graph shows the downloads per day. You can hover over the graph to see the exact number of downloads per day.