Check if a text is present in a bigger text with an error tolerance

[ABG]

This piece might be helpful:

Similarity texts

Here's the AI2 blocks implementation of Levenshtein distance. Thanks for a fun project. (Corrected version) [Capture] [Designer] Levenshtein_distance.aia (6.0 KB) [Levenshtein_distance] [when btnCalculate Click] (procedure is draggable)

If the contained text is a single word, split the big text at blanks to get a list of words, and calculate the minimum Levenshtein distance of that list of words against the contained text.

Compare the minimum Levenshtein distance against the tolerance.

If the contained text is not a single word, sweep the contained text against the big text letter by letter using the segment() block, seeking a minimum Levenshtein distance.