Lilaclilacperegrine
Aug 9, 2026, 4:37 AMthis is based off a markov model
if we say the transition matrix is M, and that the new text has different words but the same underlying structure (like words are replaced), then M' = P*M*P^T for a permutation matrix P.
Then, we can take an eigenvector decomposition of both and use that to reverse-engineer P.