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
Hi thanks for your great work. I am reading the paper and noticed a bug which I assume to be a typo.
In the arxiv paper (https://arxiv.org/abs/2303.00747), Listing1 shows the pseudo code for smoothing. I noticed that the min-cut modification implementation seems incorrect. instead of
sc = scores[t]
...
pdx = i + max_len //2
qdx = i + max_len
min_sp = argmin(scores[pdx:qdx])
segs.append((start, pdx+min_sp))
Hi thanks for your great work. I am reading the paper and noticed a bug which I assume to be a typo.
In the arxiv paper (https://arxiv.org/abs/2303.00747), Listing1 shows the pseudo code for smoothing. I noticed that the min-cut modification implementation seems incorrect. instead of
shouldn't it be like this?
I also checked the code in this repo, which seems to be consistent with the corrected version. Correct me if I misunderstood it?
The text was updated successfully, but these errors were encountered: