Studio

by Internal Labs

491

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 Internal Labs

<100

Levenshtein Distance calculates the minimum edits (insertions, deletions, substitutions) to transform one string into another. Used in spell check, fuzzy search; runs in 𝑂 ( 𝑛 × 𝑚 ) O(n×m) time.

by Internal Labs

<100

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

by BotVelocity

<100

A collection of 6 custom activities for UiPath that implement various string matching and comparison algorithms.

by Internal Labs

<100

UiPath workflow for Jaro String Matching calculates similarity between strings, aiding in deduplication, record linkage, fuzzy matching, and automation. Scalable, reusable, and ideal for data accuracy

by Internal Labs

<100

Hamming Distance measures the difference between two equal-length strings by counting differing positions. It's used in error detection, genomics, and text comparison to assess string similarity.

by Internal Labs

<100

In RPA it improves text similarity matching for deduplication, email classification and data standardization. Customizable thresholds and enhanced efficiency make it ideal for high-volume tasks.