String Matcher

The String Matcher node is able to compare two lists of strings, compute the distance between these strings and list the most similar strings in the output table. The node requires two input data tables. A data table containing the strings to compare and a data table containing a dictionary. The String Matcher finds for each element of the data table the most similar words in the dictionary table. To compare the elements the levenshtein-damerau-distance is used. This function calculates how many insertions, deletions, changing and swappings are at least necessary to change one word into another. To find an optimal solution it is necessary that the weight of two switches is greater or equal than the weight of an insert and a deletion.

Input ports

1. Type: Table
   Data Table
   The data table containing the column with the words to search for in the dictionary table
2. Type: Table
   Dictionary Table
   The data table, containing the column with the dictionary strings.

Output ports

1. Type: Table
   Related Words
   The data table, with the original strings in the first column, if specified the minimal distance in the second column, the most related words (all with the same distance to the origin) are listed in the third column.