-
Notifications
You must be signed in to change notification settings - Fork 14
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
Add greedy time-constrained ORC-WER #91
Conversation
We should add again a print in the cli. e.g. printing the files that are written and/or a summary of the WER. |
tmp[current, 0] = tmp[prev, 0] + 1 | ||
for i in range(1, a.shape[0] + 1): | ||
a_ = a[i - 1] | ||
if a_begin[i - 1] >= b_end_ or b_begin_ >= a_end[i - 1]: |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Do we use touching as no overlap?
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Yes, we decided for this in the time-constrained Levenshtein distance inn levenshtein.h
and now everything is tested against that. I think the argument was that two time points should not overlap
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
ok. I just wanted to ensure, that it is the same.
Yes, I agree. But that should be a separate PR. |
No description provided.