我一直在使用R中的"adist"函数,它计算两个字符串之间的Levenshtein距离.这是一个可重复的例子:
>a <- c("bonjour", "bonsoir", "good morning", "hello world")
>b <- c("maman", "bienjoue", "printemps")
>adist(a, b, counts = TRUE)
我得到的结果如下:
[,1] [,2] [,3]
[1,] 7 3 8
[2,] 7 5 8
[3,] 10 11 12
[4,] 11 10 11
attr(,"counts")
, , ins
[,1] [,2] [,3]
[1,] 0 1 2
[2,] 0 1 2
[3,] 0 0 1
[4,] 0 1 0
, , del
[,1] [,2] [,3]
[1,] 2 0 0
[2,] 2 0 0
[3,] 7 4 4 …