Improve timestamp heuristics (#336)
* Improve timestamp heuristics * Chore
This commit is contained in:
@@ -370,6 +370,7 @@ class WhisperModel:
|
||||
else:
|
||||
all_tokens.extend(options.initial_prompt)
|
||||
|
||||
last_speech_timestamp = 0.0
|
||||
while seek < content_frames:
|
||||
time_offset = seek * self.feature_extractor.time_per_frame
|
||||
segment = features[:, seek : seek + self.feature_extractor.nb_max_frames]
|
||||
@@ -511,12 +512,14 @@ class WhisperModel:
|
||||
segment_size,
|
||||
options.prepend_punctuations,
|
||||
options.append_punctuations,
|
||||
last_speech_timestamp=last_speech_timestamp,
|
||||
)
|
||||
|
||||
word_end_timestamps = [
|
||||
w["end"] for s in current_segments for w in s["words"]
|
||||
]
|
||||
|
||||
if len(word_end_timestamps) > 0:
|
||||
last_speech_timestamp = word_end_timestamps[-1]
|
||||
if not single_timestamp_ending and len(word_end_timestamps) > 0:
|
||||
seek_shift = round(
|
||||
(word_end_timestamps[-1] - time_offset) * self.frames_per_second
|
||||
@@ -695,6 +698,7 @@ class WhisperModel:
|
||||
num_frames: int,
|
||||
prepend_punctuations: str,
|
||||
append_punctuations: str,
|
||||
last_speech_timestamp: float,
|
||||
):
|
||||
if len(segments) == 0:
|
||||
return
|
||||
@@ -708,6 +712,26 @@ class WhisperModel:
|
||||
alignment = self.find_alignment(
|
||||
tokenizer, text_tokens, encoder_output, num_frames
|
||||
)
|
||||
word_durations = np.array([word["end"] - word["start"] for word in alignment])
|
||||
word_durations = word_durations[word_durations.nonzero()]
|
||||
median_duration = np.median(word_durations) if len(word_durations) > 0 else 0.0
|
||||
max_duration = median_duration * 2
|
||||
|
||||
# hack: truncate long words at sentence boundaries.
|
||||
# a better segmentation algorithm based on VAD should be able to replace this.
|
||||
if len(word_durations) > 0:
|
||||
median_duration = np.median(word_durations)
|
||||
max_duration = median_duration * 2
|
||||
sentence_end_marks = ".。!!??"
|
||||
# ensure words at sentence boundaries
|
||||
# are not longer than twice the median word duration.
|
||||
for i in range(1, len(alignment)):
|
||||
if alignment[i]["end"] - alignment[i]["start"] > max_duration:
|
||||
if alignment[i]["word"] in sentence_end_marks:
|
||||
alignment[i]["end"] = alignment[i]["start"] + max_duration
|
||||
elif alignment[i - 1]["word"] in sentence_end_marks:
|
||||
alignment[i]["start"] = alignment[i]["end"] - max_duration
|
||||
|
||||
merge_punctuations(alignment, prepend_punctuations, append_punctuations)
|
||||
|
||||
time_offset = (
|
||||
@@ -738,21 +762,52 @@ class WhisperModel:
|
||||
saved_tokens += len(timing["tokens"])
|
||||
word_index += 1
|
||||
|
||||
# hack: truncate long words at segment boundaries.
|
||||
# a better segmentation algorithm based on VAD should be able to replace this.
|
||||
if len(words) > 0:
|
||||
segment["start"] = words[0]["start"]
|
||||
# ensure the first and second word after a pause is not longer than
|
||||
# twice the median word duration.
|
||||
if words[0]["end"] - last_speech_timestamp > median_duration * 4 and (
|
||||
words[0]["end"] - words[0]["start"] > max_duration
|
||||
or (
|
||||
len(words) > 1
|
||||
and words[1]["end"] - words[0]["start"] > max_duration * 2
|
||||
)
|
||||
):
|
||||
if (
|
||||
len(words) > 1
|
||||
and words[1]["end"] - words[1]["start"] > max_duration
|
||||
):
|
||||
boundary = max(
|
||||
words[1]["end"] / 2, words[1]["end"] - max_duration
|
||||
)
|
||||
words[0]["end"] = words[1]["start"] = boundary
|
||||
words[0]["start"] = max(0, words[0]["end"] - max_duration)
|
||||
|
||||
# hack: prefer the segment-level end timestamp if the last word is too long.
|
||||
# a better segmentation algorithm based on VAD should be able to replace this.
|
||||
# prefer the segment-level start timestamp if the first word is too long.
|
||||
if (
|
||||
segment["start"] < words[0]["end"]
|
||||
and segment["start"] - 0.5 > words[0]["start"]
|
||||
):
|
||||
words[0]["start"] = max(
|
||||
0, min(words[0]["end"] - median_duration, segment["start"])
|
||||
)
|
||||
else:
|
||||
segment["start"] = words[0]["start"]
|
||||
|
||||
# prefer the segment-level end timestamp if the last word is too long.
|
||||
if (
|
||||
segment["end"] > words[-1]["start"]
|
||||
and segment["end"] + 0.5 < words[-1]["end"]
|
||||
):
|
||||
# adjust the word-level timestamps based on the segment-level timestamps
|
||||
words[-1]["end"] = segment["end"]
|
||||
words[-1]["end"] = max(
|
||||
words[-1]["start"] + median_duration, segment["end"]
|
||||
)
|
||||
else:
|
||||
# adjust the segment-level timestamps based on the word-level timestamps
|
||||
segment["end"] = words[-1]["end"]
|
||||
|
||||
last_speech_timestamp = segment["end"]
|
||||
|
||||
segment["words"] = words
|
||||
|
||||
def find_alignment(
|
||||
@@ -796,32 +851,6 @@ class WhisperModel:
|
||||
for i, j in zip(word_boundaries[:-1], word_boundaries[1:])
|
||||
]
|
||||
|
||||
# hack: truncate long words at the start of a window and the start of a sentence.
|
||||
# a better segmentation algorithm based on VAD should be able to replace this.
|
||||
word_durations = end_times - start_times
|
||||
word_durations = word_durations[word_durations.nonzero()]
|
||||
if len(word_durations) > 0:
|
||||
median_duration = np.median(word_durations)
|
||||
max_duration = median_duration * 2
|
||||
sentence_end_marks = ".。!!??"
|
||||
# ensure words at sentence boundaries are not longer than twice the median
|
||||
# word duration.
|
||||
for i in range(1, len(start_times)):
|
||||
if end_times[i] - start_times[i] > max_duration:
|
||||
if words[i] in sentence_end_marks:
|
||||
end_times[i] = start_times[i] + max_duration
|
||||
elif words[i - 1] in sentence_end_marks:
|
||||
start_times[i] = end_times[i] - max_duration
|
||||
# ensure the first and second word is not longer than twice the median word duration.
|
||||
if len(start_times) > 0 and end_times[0] - start_times[0] > max_duration:
|
||||
if (
|
||||
len(start_times) > 1
|
||||
and end_times[1] - start_times[1] > max_duration
|
||||
):
|
||||
boundary = max(end_times[1] / 2, end_times[1] - max_duration)
|
||||
end_times[0] = start_times[1] = boundary
|
||||
start_times[0] = max(0, end_times[0] - max_duration)
|
||||
|
||||
return [
|
||||
dict(
|
||||
word=word, tokens=tokens, start=start, end=end, probability=probability
|
||||
|
||||
Reference in New Issue
Block a user