Strings
String similarity
4min
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.
- Block Distance
- Chapman Length Deviation
- Chapman Mean Deviation
- Cosine Similarity
- Jaccard Similarity
- Euclidean Distance
- Dice Similarity
- Jaro
- Jaro Winkler
- Matching Coefficient
- Monge Elkan
- Levenstein
- Needleman Wunch
- Overlap Coefficient
- QGrams Distance
- Smith Waterman
- Smith Waterman Gotoh
- 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.
For a more in depth guide intended for C#/.Net developers follow this link.
The code used to create the SearchByStringSimilarity can be found here.
Updated 31 Aug 2023
Did this page help you?