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 166 times in the last 30 days. Now we're getting somewhere! Enough downloads to populate a lively group chat. The following heatmap shows the distribution of downloads per day. Yesterday, it was downloaded 2 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,059 times in the last 365 days. That's enough downloads to impress a room full of undergrads. A commendable achievement indeed. 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.