kanjidistmat {kanjistat} | R Documentation |
Compute distance matrix based on hierarchical optimal transport for lists of kanjivec objects
Description
Individual distances are based on kanjidist
.
Usage
kanjidistmat(
klist,
klist2 = NULL,
compo_seg_depth = 3,
p = 1,
C = 0.2,
approx = c("grid", "pc", "pcweighted"),
type = c("rtt", "unbalanced", "balanced"),
size = 48,
lwd = 2.5,
density = 30,
verbose = FALSE,
minor_warnings = FALSE
)
Arguments
klist |
a list of |
klist2 |
an optional second list of |
compo_seg_depth |
integer |
p , C , type , approx , size , lwd , density , verbose , minor_warnings |
the same as for the function |
Value
A matrix of dimension length(klist)
x length(klist2)
having
as its (i,j)
-th entry the distance between klist[[i]]
and
klist2[[j]]
. If klist2
is not provided it is assumed to be equal to
klist
, but computation is more efficient as only the upper triangular part
is computed and then symmetrized with diagonal zero.
Warning
The same precautions apply as for kanjidist
.
See Also
Examples
kanjidistmat(fivebetas)
[Package kanjistat version 0.14.1 Index]