Create your first automation in just a few minutes.Try Studio Web →
by Internal Labs
0
Snippet
<100
Summary
Summary
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.
Overview
Overview
This release introduces a new workflow, "Levenshtein Distance," to the UiPath Studio suite. The Levenshtein Distance algorithm is a widely used method for measuring the similarity between two strings by calculating the minimum number of single-character edits required to transform one string into another. These edits include:
This algorithm is particularly useful in scenarios involving approximate string matching, where minor differences between strings are allowed, such as in:
Note:
This workflow is appropriate only where custom activities are not allowed, or for educational purposes. Otherwise, custom activities should be used, which are a lot faster.
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.4
Certification
Silver Certified
Support
UiPath Community Support