Create your first automation in just a few minutes.Try Studio Web →
by Internal Labs
3
Activity
22.3k
Summary
Summary
The activity accepts two string and returns a similarity percentage in the type System.Single between two strings using Levenshtein Algorithm.
Overview
Overview
The Levenshtein algorithm (also called Edit-Distance) calculates the least number of edit operations that are necessary to modify one string to obtain another string. The most common way of calculating this is by the dynamic programming approach. A matrix is initialized measuring in the (m,n)-cell the Levenshtein distance between the m-character prefix of one with the n-prefix of the other word. The matrix can be filled from the upper left to the lower right corner. Each jump horizontally or vertically corresponds to an insert or a delete, respectively. The cost is normally set to 1 for each of the operations. The diagonal jump can cost either one, if the two characters in the row and column do not match or 0, if they do. Each cell always minimizes the cost locally. This way the number in the lower right corner is the Levenshtein distance between both words.
Features
Features
This could be essentially used when we need to compare a string with any sample data . For example the status of a request needs to be changed on basis of Approvers comment . The sample comment shared by the "the request is approved ", but the comment added by the approver is "The request raised is approved yesterday". In such cases the conventional string comparision methods will not work but the activity would give a similarity percentage .
Additional Information
Additional Information
Dependencies
NA
Code Language
Visual Basic
Runtime
Windows Legacy (.Net Framework 4.6.1)
Technical
Version
1.0.0Updated
February 18, 2020Works with
Studio: 21.10 - 22.10
Certification
Silver Certified
Tags
Support
UiPath Community Support