Studio

by Amar Srivastava

2.9k

Calculates the more robust Damerau-Levenshtein distance between two strings. Includes an activity for comparing a string against an array of strings to select the closest match.

by Internal Labs

<100

Calculates string similarity using insertions, deletions, substitutions, and transpositions. Ideal for RPA typo-tolerant matching in data validation and sorting.