What can you do with it?
Find the most similar strings from a list by comparing them to a search term. This is useful for fuzzy matching, finding near-duplicates, or ranking items by syntactic similarity. Like if someone typed in “I want to see Doctor Shallsy” and the Dr’s name is actually “Shellzy”, you could use this skill to find the matching doctor from a list of options.How does it work?
The similarity search uses Levenshtein distance to measure how similar two strings are. This algorithm calculates the minimum number of single-character edits (insertions, deletions, or substitutions) needed to transform one string into another. Distance Scoring:- Distance 0: Identical strings
- Distance 1: One character different (“cat” vs “bat”)
- Distance 2: Two edits needed (“cat” vs “dog”)
- Lower scores = more similar
- Splitting text using the specified character (default:
/
) - Excluding common patterns like version numbers, dates, file extensions
- Comparing only the relevant extracted parts
"documents/reports/quarterly_sales_report_2024_v2.pdf"
→"quarterly sales report"
"documents/archive/quarterly_sales_report_2023_final.pdf"
→"quarterly sales report"
- Result: Distance 0 (identical after extraction)
How to use it?
Basic Command Structure
Parameters
Required:-
search term
- The string you want to find matches for -
items to search
- Array of strings to search through
-
use smart extraction
- Extract and compare only the most relevant parts of paths (default: false) -
exclude patterns
- Patterns to exclude during smart extraction (default: none) -
split value
- Character used to split paths when using smart extraction (default: /) -
max results
- Maximum number of results to return (default: 5)