Nothing
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.
Getting started
Browse package contents
Package details |
|
|---|---|
| Author | Dan S. Reznik |
| Maintainer | Dan S. Reznik <dreznik@gmail.com> |
| License | MIT + file LICENSE |
| Version | 1.0 |
| Package repository | View on CRAN |
| Installation |
Install the latest version of this package by entering the following in R:
|
Try the clustringr package in your browser
Any scripts or data that you put into this service are public.
