-
Notifications
You must be signed in to change notification settings - Fork 1
/
DESCRIPTION
29 lines (29 loc) · 841 Bytes
/
DESCRIPTION
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
Package: clustringr
Type: Package
Title: Cluster Strings by Edit-Distance
Version: 1.0
Author: Dan S. Reznik
Maintainer: Dan S. Reznik <[email protected]>
Description: 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-lev), as computed by
stringdist::stringdist(). The set of all mutual edit-distances is then used by g
graph algorithms (from package igraph) to single out subsets of high connectivity.
License: MIT + file LICENSE
Encoding: UTF-8
LazyData: true
Imports:
magrittr,
dplyr,
stringi,
stringr,
stringdist,
igraph,
assertthat,
forcats,
rlang,
tidygraph,
ggraph,
ggplot2
Depends: R (>= 3.1)
RoxygenNote: 6.1.1