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

Efficiency of 2nd SequenceMatcher #47

Merged
merged 3 commits into from
Jul 22, 2018
Merged

Conversation

npmccord
Copy link
Contributor

In looking at the variation between the two SM function, there doesn't appear to be variation greater than .06 (Sample of 1000 songs). I increased the threshold slightly to take into consideration outliers, but this should reduce the performance impact of having to run SM twice on everything. Only double checking songs which narrowly missed the .5 similarity determinate.

npmccord and others added 2 commits July 21, 2018 15:02
In looking at the variation between the two SM function, there doesn't appear to be variation greater than .06 (Sample of 1000 songs).  I increased the threshold slightly to take into consideration outliers, but this should reduce the performance impact of having to run SM twice on everything.  Only double checking songs which narrowly missed the .5 similarity determinate.
@johnwmillr
Copy link
Owner

johnwmillr commented Jul 22, 2018

Good work! The seqB variable was getting called on the return statement before it was assigned if seqA.ratio() < 0.4, so I fixed that bug. I'll fix the merge conflicts with my new updates to the master branch, and it should be good to go.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Projects
None yet
Development

Successfully merging this pull request may close these issues.

None yet

2 participants