normalizedLevenshtein: Normalized Levenshtein distance
In KonstantinHoffmann/ABVDTools: Some useful tools for processing data from the ABVD database abvd.shh.mpg.de
Description
Usage
Arguments
Value
Description
Levenshtein distance of two strings is the minimal amount of edits (insertions, deletions and substitutions) to go from string1 to string2. This is normalized by the length of the longer string.
Usage
1
normalizedLevenshtein(string1, string2, ignoreCharacter = NULL, ...)
Arguments
string1
First string of comparison
string2
Second string of comparison
ignoreCharacter
Optional, character vector of symbols that will be ignored and removed from the string.
Value
Returns numeric value of the normalized Levenshtein distance
KonstantinHoffmann/ABVDTools documentation built on Dec. 14, 2021, 11:48 a.m.
R Package Documentation
Browse R Packages
We want your feedback!
Note that we can't provide technical support on individual packages. You should contact the package authors for that.
Description Usage Arguments Value
Description
Levenshtein distance of two strings is the minimal amount of edits (insertions, deletions and substitutions) to go from string1 to string2. This is normalized by the length of the longer string.
Usage
1 | normalizedLevenshtein(string1, string2, ignoreCharacter = NULL, ...)
|
Arguments
string1 |
First string of comparison |
string2 |
Second string of comparison |
ignoreCharacter |
Optional, character vector of symbols that will be ignored and removed from the string. |
Value
Returns numeric value of the normalized Levenshtein distance
R Package Documentation
Browse R Packages
We want your feedback!
Note that we can't provide technical support on individual packages. You should contact the package authors for that.
Embedding an R snippet on your website
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.