Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

score results for relevance #130

Open
thatbudakguy opened this issue Nov 11, 2020 · 1 comment
Open

score results for relevance #130

thatbudakguy opened this issue Nov 11, 2020 · 1 comment
Labels
enhancement New feature or request
Milestone

Comments

@thatbudakguy
Copy link
Member

running against a large corpus, especially with some settings, can result in a huge volume of results. many of them are "low-quality" in that the matching portion consists of superficially similar elements that don't carry much semantic weight.

adjusting the match length can help, but there might be other heuristics we can use to improve relevance. one possibility is TF-IDF.

@thatbudakguy thatbudakguy added the enhancement New feature or request label Nov 11, 2020
@thatbudakguy
Copy link
Member Author

one possible quick n' dirty way to do this is to implement something like passim's --max-series, which for us would translate to dropping seed groups from the index if there are too many entries in the group (indicating a super common seed).

if we do TF-IDF, we can also implement that at the seed level to prune the graph early.

@thatbudakguy thatbudakguy added this to the v3.0 milestone Feb 19, 2021
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
enhancement New feature or request
Projects
None yet
Development

No branches or pull requests

1 participant