Skip to main content

​
Overview

Patterns finder node
The Patterns Finder node uses fuzzy matching algorithms to identify patterns in text, even when there are spelling mistakes or variations. This is useful for finding matches in imperfect or user-generated text.

​
Credits

Cost: 0.1 credits per run

​
Inputs

  • text: The text to search within
  • matches: A list of patterns to search for, each containing:
    • pattern: The pattern to match
    • tag: A label/tag/attached information for this pattern

​
Outputs

  • results: An list of found matches, each containing:
    • pattern: The matched pattern
    • tag: The associated tag
    • score: A match score indicating match quality (From 0 to 1 - 0 being totally different and 1 being identic)