We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
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
A more advanced way to calculate coincidences and to resolve coincidence conflicts is in order.
Currently conflicting coincidences need to be kept together due to there not being a way to resolve those conflicts.
A possible way how to resolve them could be to score each partial coincidence and selecting only the highest scoring pairs as part of the coincidence.
Ultimately though there is always a potential for remaining conflicts due to incomplete datasets and each coincidence needs to be manually inspected.
The text was updated successfully, but these errors were encountered:
No branches or pull requests
A more advanced way to calculate coincidences and to resolve coincidence conflicts is in order.
Currently conflicting coincidences need to be kept together due to there not being a way to resolve those conflicts.
A possible way how to resolve them could be to score each partial coincidence and selecting only the highest scoring pairs as part of the coincidence.
Ultimately though there is always a potential for remaining conflicts due to incomplete datasets and each coincidence needs to be manually inspected.
The text was updated successfully, but these errors were encountered: