map_by_adist: Map two character vectors by approximate string distances
In jdreyf/jdcbioinfo: Joslin Diabetes Center bioinformatics utilities
map_by_adist R Documentation
Map two character vectors by approximate string distances
Description
Map two character vectors by generalized Levenshtein (edit) distance i.e. approximate string distances.
Usage
map_by_adist(x, y, ignore.case = TRUE, max.norm.dist = 0.2)
Arguments
x
a character vector.
y
a character vector.
ignore.case
a logical. If TRUE, case is ignored for computing the distances.
max.norm.dist
maximal normalized distance between 0 and 1.
Value
Two-column Data frame of which each row is the mapped elements in x and y.
jdreyf/jdcbioinfo documentation built on April 15, 2024, 6:37 p.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.
| map_by_adist | R Documentation |
Map two character vectors by approximate string distances
Description
Map two character vectors by generalized Levenshtein (edit) distance i.e. approximate string distances.
Usage
map_by_adist(x, y, ignore.case = TRUE, max.norm.dist = 0.2)
Arguments
x |
a character vector. |
y |
a character vector. |
ignore.case |
a logical. If TRUE, case is ignored for computing the distances. |
max.norm.dist |
maximal normalized distance between 0 and 1. |
Value
Two-column Data frame of which each row is the mapped elements in x and y.
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.