levenshtein_similarity: Levenshtein Similarity
In RapidFuzz: String Similarity Computation Using 'RapidFuzz'
levenshtein_similarity R Documentation
Levenshtein Similarity
Description
Levenshtein similarity measures how similar two strings are, based on the minimum number
of operations required to make them identical.
Usage
levenshtein_similarity(s1, s2)
Arguments
s1
The first string.
s2
The second string.
Value
A numeric value representing the Levenshtein similarity.
Examples
levenshtein_similarity("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_similarity | R Documentation |
Levenshtein Similarity
Description
Levenshtein similarity measures how similar two strings are, based on the minimum number of operations required to make them identical.
Usage
levenshtein_similarity(s1, s2)
Arguments
s1 |
The first string. |
s2 |
The second string. |
Value
A numeric value representing the Levenshtein similarity.
Examples
levenshtein_similarity("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.