Using fts_fuzzy_match concept for searching through multiple documents #21
Comments
|
You may run the fts_fuzzy_match over multiple files and sort the results based on the match quality. There is no need to extend fts_fuzzy_match in that regard. |
bubnikv
added a commit
to prusa3d/PrusaSlicer
that referenced
this issue
May 3, 2020
Recursive fix forrestthewoods/lib_fts#21 End of string penalty fix forrestthewoods/lib_fts#24 Some refactoring for succintness (based on Vojtech's taste)
bubnikv
added a commit
to prusa3d/PrusaSlicer
that referenced
this issue
May 4, 2020
Fix of forrestthewoods/lib_fts#21 finally applied, disabled CamelCase matching as we are not using CamelCase in Slicer parameters.
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Hi @forrestthewoods, great work on the fuzzy match, I'm having a lot of fun with it! This is a question and not an issue but I'm putting it here for future reference.
I'm a junior dev and I thinking about this idea for some time about using your algorithm for searching through multiple txt files for a particular word and then ranking them based on final score. I still don't know how to define the final score and where to start my quest. Also, is this algorithm the best approach for my case or should I consider something else?
Thank you!
The text was updated successfully, but these errors were encountered: