Create your first automation in just a few minutes.Try Studio Web →
by Internal Labs
0
Snippet
<100
Summary
Summary
Calculates string similarity using insertions, deletions, substitutions, and transpositions. Ideal for RPA typo-tolerant matching in data validation and sorting.
Overview
Overview
The Damerau-Levenshtein algorithm calculates the minimum edit distance between two strings by allowing four operations: insertion, deletion, substitution, and adjacent transposition. This makes it highly effective for handling typographical errors, particularly useful in RPA processes that require precise data validation, document sorting, and error-tolerant string matching.
Its efficient design enables high-performance matching in automated workflows, even in large datasets. Customizable edit weights allow users to fine-tune for specific applications, balancing accuracy and speed. Suitable for various RPA use cases, this algorithm improves automated processes' accuracy in matching and retrieving similar text strings.
This snippet is appropriate to be utilized in scenarios where similar activities, which are faster, cannot be used.
Features
Features
Additional Information
Additional Information
Dependencies
UiPath.System.Activities : 23.10.2
Code Language
Visual Basic
Technical
Version
1.0.0Updated
December 16, 2024Works with
Studio: 22.10.12 - 24.10.5
Certification
Silver Certified
Support
UiPath Community Support