Studio

by Internal Labs

532

This group of custom activities (String Matching Algorithms) serve the purpose of reducing development time for the user intending to implement one or more string matching logic in their project.

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 Elif Karaoglu

352

This activity finds similarity between two texts and returns similarity percentage.