Nothing
Returns an editdistance based clusterization of an input vector of strings. Each cluster will contain a set of strings w/ small mutual editdistance (e.g., Levenshtein, optimumsequencealignment, DamerauLevenshtein), as computed by stringdist::stringdist(). The set of all mutual editdistances is then used by graph algorithms (from package 'igraph') to single out subsets of high connectivity.
Package details 


Author  Dan S. Reznik 
Maintainer  Dan S. Reznik <[email protected]> 
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:

Any scripts or data that you put into this service are public.
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.