Calculate Levenshtein distance Version 1 (Net)

Action group: Text

Description

The action calculates the edit distance. This is a metric that measures modulo the difference between two character sequences. It is defined as the minimum number of single-character operations required to transform one character sequence into another.

Action icon

Settings of parameters

PropertyDescriptionTypeFilling exampleMandatory field
Parameters
First lineFirst character sequence (string) to compare.Robin.String
Yes
Second line 2Second character sequence (string) to compare.Robin.String
Yes
Results
ResultThe minimum number of insertions, deletions, and replacements of one character for another required to turn one string into another.Robin.Numeric

Special conditions of use 

None. 

Example of use 

Task

It is necessary to determine the minimum number of insertion, deletion, and replacement operations required to turn one string into another. The first sequence of characters to compare = 79, the second sequence of characters to compare = 129 

Solution

Use the "Calculate Levenshtein distance" action. 

Implementation

  1. Move the "Calculate Levenshtein distance" action to the workspace and set its parameters with the required values
  2. Click "Start" in the top panel. 

Result

The program robot completed successfully. 

The minimum number of operations has been determined.