Distribute spk. Args: sentence_list: TODO. sd_time_list: TODO.
(sentence_list, sd_time_list)
| 234 | |
| 235 | |
| 236 | def distribute_spk(sentence_list, sd_time_list): |
| 237 | """Distribute spk. |
| 238 | |
| 239 | Args: |
| 240 | sentence_list: TODO. |
| 241 | sd_time_list: TODO. |
| 242 | """ |
| 243 | sd_sentence_list = [] |
| 244 | for d in sentence_list: |
| 245 | sentence_start = d["ts_list"][0][0] |
| 246 | sentence_end = d["ts_list"][-1][1] |
| 247 | sentence_spk = 0 |
| 248 | max_overlap = 0 |
| 249 | for sd_time in sd_time_list: |
| 250 | spk_st, spk_ed, spk = sd_time |
| 251 | spk_st = spk_st * 1000 |
| 252 | spk_ed = spk_ed * 1000 |
| 253 | overlap = max(min(sentence_end, spk_ed) - max(sentence_start, spk_st), 0) |
| 254 | if overlap > max_overlap: |
| 255 | max_overlap = overlap |
| 256 | sentence_spk = spk |
| 257 | d["spk"] = sentence_spk |
| 258 | sd_sentence_list.append(d) |
| 259 | return sd_sentence_list |
no outgoing calls
no test coverage detected
searching dependent graphs…