Sign In
Create your first automation in just a few minutes.Try Studio Web →
3 results
Studio
Recommended
456
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.
Free
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.
<100
A few activities to help with string manipulation: get middle Substring with Strings, Fuzzy Search in Array, check if Strings are similar.