Version: 5 (release)
Newest release version: This is the newest release version of this Program.
Newest release or development version: This is the newest version of this Program.
Receives parameters from the option generated by the Rule Demo-levenshtein-distance.
These parameters contain a two strings. Each string can be upto 1000 characters long.
The program finds the levenshtein distance between the two strings.
The Levenshtein distance between two strings is the number of single character deletions, insertions, or substitutions
required to transform one string into the other. This is also known as the edit distance.
Created: Sept. 29, 2019, 3:09 p.m.
Docker Image: elody.com:444/demo_levenshtein_distance@sha256:c530a3fa0d69c1dcefc9a5d09a1ad1f28e271bdc0bfc52b10e7be900d9c19a58
Source code: Run the following command in a terminal to download the source code: 'lod-tools download-program -f <destination_folder> --name "Demo_levenshtein_distance" --version 5'
all versions of this Program:
Version 5 (release)