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

Develop an algorithm to decide what is the best value mapping algorithm for a specific case #60

Open
roquelopez opened this issue Jun 25, 2024 · 1 comment
Assignees
Labels
enhancement New feature or request

Comments

@roquelopez
Copy link
Collaborator

For cases where we want to map ['pN0', 'pN1', 'pN2', 'pNX'] -> ['N0', 'N1', 'N2', 'NX'] the edit distance method is more promising, but for cases like ['Deceased', 'Living'] -> ['Dead', 'Alive'], the embedding approach is better.

Implement a method to select the most promising algorithm.

@roquelopez roquelopez self-assigned this Jun 25, 2024
@julianafreire
Copy link
Member

We should provide the ability for users to try different methods so that they can check and compare the results. For example, we can have a function that tries all matching strategies, or a set specified by the user: match_column_values(col1,col2,[edit_distance,embedding,jaccard_trigram]). Similar to what we have for the attribute matching, we could display the results and allow users to indicate the correct one, or to provide an alternative method (e.g., a python function)

@aecio aecio added the enhancement New feature or request label Jun 25, 2024
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

3 participants