Expand fuzzy string matching to collection of words for Marco.wordsearch method

[andrewrgarcia]

In line 192 of bcrpy/main.py it can be seen that fuzzy string matching is assessed for ANY word in the word sequence that may be greater than the cutoff value ( due to the word splitting and individual assessments thereof) . Because of this limitation, keyword can only be a single word with no spacing; spacing still considers it a single word and ergo, collections of words fail in giving accurate matches.

The idea is to implement a better language processing algorithm that may assess both individual words and collection of words with the cutoff metric.

[andrewrgarcia]

image text (to run as prompt):

Desired wordsearch behavior

red apple --> [red apple] find: red apple (cutoff 1.0) FOUND

red apple Newton --> [red apple, Newton] find: red apple (cutoff 1.0) FOUND