Paper recorded by Signals 4 on 2026-09-04 in cs.LG. Abstract reproduced from arXiv; link to the original below.
Published 2026-09-04 on arXiv · recorded by Signals 4 on 2026-09-07
Category: cs.LG · 机器学习 · first seen 2026-09-07
Does a simplified legal clause still say what the original said? The checks in current use cannot establish that it does: requiring an identical pair to score highest and an unrelated pair lowest moves lexical overlap and legal force together, so any monotone function of token overlap satisfies both. Our remedy is a dissociation, an item holding surface form fixed while legal force moves. We relea