levenshtein_distance: Levenshtein Distance
In RapidFuzz: String Similarity Computation Using 'RapidFuzz'
levenshtein_distance R Documentation
Levenshtein Distance
Description
Calculates the Levenshtein distance between two strings, which represents the minimum number
of insertions, deletions, and substitutions required to transform one string into the other.
Usage
levenshtein_distance(s1, s2)
Arguments
s1
The first string.
s2
The second string.
Value
A numeric value representing the Levenshtein distance.
Examples
levenshtein_distance("kitten", "sitting")
RapidFuzz documentation built on April 3, 2025, 11:52 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.
| levenshtein_distance | R Documentation |
Levenshtein Distance
Description
Calculates the Levenshtein distance between two strings, which represents the minimum number of insertions, deletions, and substitutions required to transform one string into the other.
Usage
levenshtein_distance(s1, s2)
Arguments
s1 |
The first string. |
s2 |
The second string. |
Value
A numeric value representing the Levenshtein distance.
Examples
levenshtein_distance("kitten", "sitting")
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.