String Similarity Computation Using 'RapidFuzz'
Damerau-Levenshtein Distance
Normalized Damerau-Levenshtein Distance
Normalized Damerau-Levenshtein Similarity
Damerau-Levenshtein Similarity
Apply Edit Operations to String
Apply Edit Operations to Vector
Extract Best Match
Extract Matches with Scoring and Limit
Extract Matches
Partial Ratio Calculation
Quick Ratio Calculation
Simple Ratio Calculation
Combined Token Ratio
Token Set Ratio Calculation
Token Sort Ratio Calculation
Weighted Ratio Calculation
Get Edit Operations
Hamming Distance
Normalized Hamming Distance
Normalized Hamming Similarity
Hamming Similarity
Indel Distance
Normalized Indel Distance
Normalized Indel Similarity
Indel Similarity
Jaro Distance
Normalized Jaro Distance
Normalized Jaro Similarity
Jaro Similarity
Jaro-Winkler Distance
Normalized Jaro-Winkler Distance
Similaridade Normalizada Jaro-Winkler
Jaro-Winkler Similarity
LCSseq Distance
LCSseq Edit Operations
Normalized LCSseq Distance
Normalized LCSseq Similarity
LCSseq Similarity
Levenshtein Distance
Normalized Levenshtein Distance
Normalized Levenshtein Similarity
Levenshtein Similarity
Apply Opcodes to String
Apply Opcodes to Vector
Distance Using OSA
Edit Operations Using OSA
Normalized Distance Using OSA
Normalized Similarity Using OSA
Similarity Using OSA
Postfix Distance
Normalized Postfix Distance
Normalized Postfix Similarity
Postfix Similarity
Calculate the prefix distance between two strings
Calculate the normalized prefix distance between two strings
Calculate the normalized prefix similarity between two strings
Calculate the prefix similarity between two strings
Process a String
Provides a high-performance interface for calculating string similarities and distances, leveraging the efficient library 'RapidFuzz' <https://github.com/rapidfuzz/rapidfuzz-cpp>. This package integrates the 'C++' implementation, allowing 'R' users to access cutting-edge algorithms for fuzzy matching and text analysis.