Similarity Search
The Similarity Search action enables users to search for a specific string within a list of strings using various similarity algorithms. This featureโฆ
Description
The Similarity Search action enables users to search for a specific string within a list of strings using various similarity algorithms. This feature is particularly useful for tasks such as fuzzy matching or finding similar items within a dataset.
Action Inputs
The action requires the following inputs:
List of strings to search in
Specify the list of strings (list<string>) in which the search will be performed.
Similarity Algorithm
Choose one of the available similarity algorithms to use for the search. The supported algorithms are:
- 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
Similarity Threshold
Define a threshold value of type double between 0 and 1.
Strings with a similarity below this threshold will not be included in the search results.
String to search for
Specify the string you want to search for within the list of strings.
Limit number of search results
Limit the number of search results returned by specifying the maximum number of results to display.
Action Output
Upon execution, the action returns a list containing the top x strings, with the most relevant ones appearing at the top.
Usage Example
For a more in-depth guide intended for C#/.Net developers follow thisย link.
The code used to create the action can be found here.