You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
I use fuzzywuzzy to match full names extracted from documents to names in a database. Discarding order is import for this matching goal. Typically I use fuzz.token_sort_ratio to obtain:
To cope with this I would propose a robust token_sim_ratio function that sorts the second list of tokens according to its similarity with the tokens in the first list. I have currently implemented a light-weight solution based on ngram-matching that is robust to mistakes in the first letter of tokens.
My question; is there a general appetite for such a functionality, and if so should I proceed with making a PR for this feature?
The text was updated successfully, but these errors were encountered:
Hi,
I use fuzzywuzzy to match full names extracted from documents to names in a database. Discarding order is import for this matching goal. Typically I use
fuzz.token_sort_ratio
to obtain:As the names suggest this function sorts the individual tokens, however in multiple instances this gave undesirable results, e.g.
To cope with this I would propose a robust
token_sim_ratio
function that sorts the second list of tokens according to its similarity with the tokens in the first list. I have currently implemented a light-weight solution based on ngram-matching that is robust to mistakes in the first letter of tokens.My question; is there a general appetite for such a functionality, and if so should I proceed with making a PR for this feature?
The text was updated successfully, but these errors were encountered: