String similarity

One of the most useful string actions set at your disposal is Search By String Similarity, it allows you to search inside a list of strings using similarity algorithms with a specified precision.

String Similarity Algorithms

1. Block Distance
2. Chapman Length Deviation
3. Chapman Mean Deviation
4. Cosine Similarity
5. Jaccard Similarity
6. Euclidean Distance
7. Dice Similarity
8. Jaro
9. Jaro Winkler
10. Matching Coefficient
11. Monge Elkan
12. Levenstein
13. Needleman Wunch
14. Overlap Coefficient
15. QGrams Distance
16. Smith Waterman
17. Smith Waterman Gotoh
18. Smith Waterman Gotoh Windowed Affine



When configuring the action you will need to have the following variables prepared:

• a list variable containing the strings to search in;
• a variable containing the string you search for;
• a integer variable for the number of strings to expect;
• the output list<string> containing the result



Use the following configurations for the action, with the mention that:



• Similarity algorithm - is the similarity threshold is used on each string of the list. You will use a int between 0 and 1, the smaller it is the less similar the result will be.
• Similarity algorithm - the dropdown allows you to choose the algorithm used.