ETC-Bench: A Multilingual Benchmark for Evaluation-Side Transcript Canonicalization
AspireAI community · arXiv
ETC-Bench is described by its authors as the first multilingual benchmark for evaluation-side transcript canonicalization, the task of mapping different written forms of the same speech to one canonical form when the difference is not determined by the audio. It covers 181 phenomenon types across 12 languages, and each instance is a minimal pair sharing sentence context and differing only in a target span. The authors introduce a metric called Semantic-preserving Exact-match Normalization Accuracy, which combines exact agreement between independently canonicalized pair members with a pair-relative BERTScore constraint against information loss, plus a Taxonomy-guided Agent Canonicalization Skill that gives agents phenomenon descriptions and explicit canonicalization contracts. Across five baseline configurations and three TACS-based agents, the agents outperform the baselines on shared languages. The v2 update added the public repository and an additional author.
Read the story and explore more from the AspireAI community.
Two sparse-autoencoder analyses have resisted scaling: matching semantically similar features across layers, and compressing large feature circuits into interpretable supernodes. This paper argues both are the same underlying problem, estimating semantic distances between SAE features that sit on different activation manifolds. Its representation treats each feature not as a single decoder vector but as an activation-weighted distribution over the hidden states expressing it, projects those distributions into a shared reference space, and compares them with Wasserstein distance. The representation is proved invariant to activation rescaling and stable under perturbation, and recovers true matches under finite-sample margin conditions. Empirically it outperformed decoder-vector and LLM-based baselines and captured subtle functional distinctions between related features, and it compressed large feature circuits into interpretable supernodes automatically. The limitation is that this is interpretability tooling: the paper demonstrates better feature matching and circuit compression, not that downstream interpretability claims become more accurate.