#!/usr/bin/env python3 """Stellt Rohabschrift und korrigierten Text gegenüber: welche Wörter hat das Modell ersetzt, eingefügt oder gestrichen? Ausgabe als HTML-Bericht.""" from collections import Counter from dataclasses import dataclass, field from difflib import SequenceMatcher from functools import lru_cache from pathlib import Path import argparse import html import re from vtt2txt import vtt_to_lines # "[prüfen: …]" in German transcripts, "[check: …]" in English ones REVIEW_MARK = re.compile(r"\[(?:prüfen|check):[^\]]*\]") TOKEN = re.compile(rf"{REVIEW_MARK.pattern}|\S+") NON_WORD = re.compile(r"[^\w]+") NON_WORD_KEEP_APOSTROPHE = re.compile(r"[^\w']+") APOSTROPHES = str.maketrans("’‘`´", "''''") ABBREVIATION = re.compile(r"\w\.") # one part of "z. B.", "d. h." ABBREVIATION_END = re.compile(r"(?:^|\s)\w\.$") EMPTY = "∅" # System word lists (Debian/Ubuntu packages wngerman, wamerican): a replaced # word found there was a real word, not a recognition error WORDLISTS = { "de": Path("/usr/share/dict/ngerman"), "en": Path("/usr/share/dict/american-english"), } WORDLIST_PACKAGES = {"de": "wngerman", "en": "wamerican"} MIN_SIMILARITY = 0.6 # below this a replacement counts as heavily changed # Per language: "er" and "um" are fillers in English, real words in German FILLERS = { "de": {"äh", "ähm", "öh", "öhm", "hm", "hmm"}, "en": {"uh", "uhm", "um", "er", "erm", "hm", "hmm"}, } CONTEXT_WORDS = 6 VALID_WORD = "gültiges Wort ersetzt" CHANGED_A_LOT = "stark verändert" INSERTED = "eingefügt" DELETED = "gestrichen" def add_token(words, token): """Append a token; attach punctuation-only tokens ("–") to the previous word and join split abbreviations ("z. B."), so neither counts as a word change.""" if words and ( not NON_WORD.sub("", token) or (ABBREVIATION.fullmatch(token) and ABBREVIATION_END.search(words[-1])) ): words[-1] += " " + token else: words.append(token) def normalize(word): """Compare words without case and punctuation; those changes are expected. Apostrophes inside a word count ("Bahr’s" is not "Bahrs"), quotes at its edges do not. """ word = word.lower().translate(APOSTROPHES) return NON_WORD_KEEP_APOSTROPHE.sub("", word).strip("'") or word @dataclass class Comparison: raw: list # words of the raw transcript words: list # words of the corrected text, without review marks paragraph: list # paragraph number of each corrected word marks: dict = field(default_factory=dict) # word index -> review marks after it opcodes: list = field(default_factory=list) suspects: list = field(default_factory=list) # Suspect, see review_candidates def changes(self): """Yield (tag, raw words, corrected words) for every difference.""" for tag, i1, i2, j1, j2 in self.opcodes: if tag != "equal": yield tag, self.raw[i1:i2], self.words[j1:j2] def compare(raw, corrected): """Word-level comparison of the raw transcript and the corrected text.""" words, paragraph, marks = [], [], {} for number, text in enumerate(re.split(r"\n\s*\n", corrected.strip())): start = len(words) for token in TOKEN.findall(text): # Review marks stay out of the comparison, but are shown after their word if REVIEW_MARK.fullmatch(token): marks.setdefault(len(words) - 1, []).append(token) # Punctuation is never merged across paragraphs elif len(words) == start: words.append(token) else: add_token(words, token) paragraph += [number] * (len(words) - start) raw_words = [] for token in raw.split(): add_token(raw_words, token) matcher = SequenceMatcher( None, [normalize(w) for w in raw_words], [normalize(w) for w in words], autojunk=False, ) return Comparison(raw_words, words, paragraph, marks, matcher.get_opcodes()) @dataclass class Suspect: """A change by the model worth a look; j1:j2 are corrected word indices.""" j1: int j2: int old: str new: str reason: str @lru_cache(maxsize=None) def load_wordlist(lang): """Lower-case words of the system word list, or None if it is missing. Read once per run (the German list has some 350,000 words). """ path = WORDLISTS.get(lang) if path is None or not path.is_file(): package = WORDLIST_PACKAGES.get(lang) hint = f" (Paket {package})" if package else "" print( f"Hinweis: keine Wortliste für „{lang}“{hint}; " "ersetzte gültige Wörter werden nicht erkannt." ) return None with path.open(encoding="utf-8", errors="replace") as words: return {line.strip().lower() for line in words if line.strip()} def glossary_entries(terms, replacements): """Glossary terms and replacement targets as tuples of normalized words.""" texts = list(terms) + [right for _, right in replacements] return {tuple(normalize(word) for word in text.split()) for text in texts} - {()} def spelling_key(words): """Letters only: joining, splitting and hyphens make no difference.""" return re.sub(r"[\W_]+", "", "".join(words).lower()) def similarity(old, new): return SequenceMatcher(None, spelling_key(old), spelling_key(new)).ratio() def glossary_spelling(old, new, glossary): """True if `new` is a glossary spelling of `old`: the new words stand together in one glossary entry and resemble the old ones. Common words of longer entries ("finden Sie") explain nothing on their own.""" words = tuple(normalize(word) for word in new) size = len(words) in_entry = any( entry[start:start + size] == words for entry in glossary for start in range(len(entry) - size + 1) ) return in_entry and similarity(old, new) >= MIN_SIMILARITY def review_candidates(comparison, wordlist=None, glossary=(), fillers=FILLERS["de"]): """Changes the model made on its own that may alter the meaning. Not reported: changes of spacing, hyphens and punctuation only, glossary spellings of the old words, deleted filler words, and replacements of words not in the word list (recognition errors) that stay similar. """ suspects = [] for tag, i1, i2, j1, j2 in comparison.opcodes: if tag == "equal": continue old, new = comparison.raw[i1:i2], comparison.words[j1:j2] if tag == "delete": if all(normalize(word) in fillers for word in old): continue reason = DELETED elif tag == "insert": reason = INSERTED else: if spelling_key(old) == spelling_key(new) or glossary_spelling(old, new, glossary): continue if wordlist is not None and all(normalize(w) in wordlist for w in old): reason = VALID_WORD elif similarity(old, new) < MIN_SIMILARITY: reason = CHANGED_A_LOT else: continue suspects.append(Suspect(j1, j2, " ".join(old), " ".join(new), reason)) return suspects def change_summary(comparison): """[(old, new, count)] of all changes, most frequent first.""" counts = Counter( (" ".join(old), " ".join(new)) for _, old, new in comparison.changes() ) return [(old, new, count) for (old, new), count in counts.most_common()] STYLE = """ :root { --bg: #fff; --fg: #1d1d1f; --muted: #6e6e73; --rep: #fff3b0; --ins: #d9f7d9; --del: #fde2e2; --check: #ffe0b3; --line: #ddd; --warn: #d70015; } @media (prefers-color-scheme: dark) { :root { --bg: #1c1c1e; --fg: #f2f2f7; --muted: #a1a1a6; --rep: #5c4d00; --ins: #1f4d1f; --del: #5c1f1f; --check: #5c3a00; --line: #3a3a3c; --warn: #ff6961; } } body { background: var(--bg); color: var(--fg); font: 16px/1.6 system-ui, sans-serif; max-width: 50rem; margin: 0 auto; padding: 1.5rem 1rem; } h1 { font-size: 1.4rem; } h2 { font-size: 1.15rem; margin-top: 2rem; } .muted { color: var(--muted); } table { border-collapse: collapse; width: 100%; font-size: 0.95rem; } td, th { border-bottom: 1px solid var(--line); padding: 0.2rem 0.5rem; text-align: left; } td.n { text-align: right; width: 3rem; } .rep { background: var(--rep); } ins { background: var(--ins); text-decoration: none; } del { background: var(--del); } .orig { color: var(--muted); font-size: 0.8em; } .check { background: var(--check); font-size: 0.85em; } .warn { outline: 2px solid var(--warn); outline-offset: 1px; border-radius: 2px; } td.ctx { color: var(--muted); } td.ctx b { color: var(--fg); } """ def render_html(comparison, title): esc = html.escape summary = change_summary(comparison) counts = Counter(tag for tag, _, _ in comparison.changes()) review_marks = sum(len(m) for m in comparison.marks.values()) rows = "\n".join( f"
| Grund | vorher | korrigiert | " f"Zusammenhang |
|---|
Keine auffälligen Änderungen gefunden.
" # Suspect words are framed; a suspect deletion shows ⚠ after the word before it warn_words, warn_after = {}, {} for s in suspects: note = esc(f"{s.reason}: „{s.old or EMPTY}“ → „{s.new or EMPTY}“", quote=True) if s.j1 == s.j2: warn_after.setdefault(max(s.j1 - 1, 0), []).append(note) for j in range(s.j1, s.j2): warn_words[j] = note # Corrected text with its paragraphs; each word knows its paragraph parts = [] current = 0 def emit(j, piece): nonlocal current if comparison.paragraph[j] != current: current = comparison.paragraph[j] parts.append("\n")
if j in warn_words:
piece = f"{piece}"
parts.append(piece)
for mark in comparison.marks.get(j, []):
parts.append(f"{esc(mark)}")
for note in warn_after.get(j, []):
parts.append(f"⚠")
for tag, i1, i2, j1, j2 in comparison.opcodes:
old = " ".join(comparison.raw[i1:i2])
if tag == "delete":
parts.append(f"{esc(old)}")
continue
for j in range(j1, j2):
word = esc(comparison.words[j])
if tag == "equal":
emit(j, word)
elif tag == "insert":
emit(j, f"{word}")
else:
emit(j, f"{word}")
if tag == "replace":
parts.append(f"({esc(old)})")
text = " ".join(parts).replace("
", "
\n") return f"""
{len(comparison.raw)} Wörter Rohtext, {len(comparison.words)} Wörter korrigiert. {counts['replace']} ersetzt, {counts['insert']} eingefügt, {counts['delete']} gestrichen, {review_marks} Prüfmarken, {len(suspects)} Stellen zu prüfen. Groß-/Kleinschreibung und Satzzeichen sind nicht markiert.
ersetzt (Original)
eingefügt gestrichen [prüfen: …]
zu prüfen
Eigenmächtige Änderungen des Modells, die den Sinn ändern können: gültige Wörter ersetzt, stark veränderte, eingefügte oder gestrichene Wörter. „vorher“ ist der Text, den das Modell bekommen hat (nach den Glossar-Ersetzungen).
{suspect_table}| × | Rohtext | korrigiert |
|---|
{text}
""" def suspect_context(comparison, suspect): """HTML: the change in bold with a few corrected words around it.""" esc = html.escape words = comparison.words before = " ".join(words[max(0, suspect.j1 - CONTEXT_WORDS):suspect.j1]) after = " ".join(words[suspect.j2:suspect.j2 + CONTEXT_WORDS]) if suspect.j1 == suspect.j2: middle = f"