QS: Fuzzy search strings

[ooprathamm]

Closes #705

• Experimented with Levenshtein distance and jaro similarity.
• Tokenizing Levenshtein distance for sentence-like strings yielded the best results
• For Levenshtein distance calculations, the RapidFuzz module was utilized. If a custom function for TaggedStrings is preferred, please let me know :)

[williballenthin]

hey @ooprathamm!

Sorry that you're missing a bit of context here: the QS issues tagged "ui" are ideas for an interactive TUI program (that doesn't exist yet). We had in mind to extend QS to have a bunch of additional functionality for exploring strings, like searching, inspecting, cross referencing, etc. using a console interface similar to ranger, gitui, htop, etc. But, we haven't finalized the design or built it yet, so these issues track our ideas.

Anyways, thank you for the PR here - I think we'll be able to use the implementation if/when we add searching to the TUI.

[ooprathamm]

Apologies it seems I have misunderstood the context of the issue.
Thank you for bringing it to my attention.