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.
Options
Views
- This node has no views
Workflows
03 Standardizing String DataKNIME Hub- 03_Co-occurrence_NetworkKNIME Hub
- 03_Co-occurrence_NetworkKNIME Hub
- 03_Co-occurrence_NetworkKNIME Hub
- 03_Co-occurrence_NetworkKNIME Hub
- Show all 75 workflows
Links
- Similarity search?by izaychik63 on 2019-07-15forum.knime.com/p/65532
- Text processing and comparison of two different set of documentsby HansS on 2019-08-04forum.knime.com/p/67111
- Better Comparison in String manipulationby izaychik63 on 2019-09-20forum.knime.com/p/70552
- Fuzzy Text Match/Similarity Searchby izaychik63 on 2019-09-18forum.knime.com/p/70378
- Allocate Misspelled country names to correct country namesby armingrudd on 2019-05-08forum.knime.com/p/60168
- Records Fuzzy Match/Linkby AnotherFraudUser on 2020-06-15forum.knime.com/p/94365
Developers
You want to see the source code for this node? Click the following button and we’ll use our super-powers to find it for you.