| ... | ... | @@ -9,4 +9,5 @@ Damerau–Levenshtein (DL) distance is the number of insertions, deletions and s |
|
|
|
|
|
|
|
References
|
|
|
|
-----
|
|
|
|
[Van der Loo M (2014)](https://journal.r-project.org/archive/2014-1/loo.pdf). The stringdist package for approximate string matching. The R Journal, 6, 111-122. https://CRAN.R-project.org/package=stringdist. |
|
|
\ No newline at end of file |
|
|
|
[Van der Loo M (2014)](https://journal.r-project.org/archive/2014-1/loo.pdf). The stringdist package for approximate string matching. The R Journal, 6, 111-122. <br>
|
|
|
|
https://CRAN.R-project.org/package=stringdist. |
|
|
\ No newline at end of file |
