Login
You're viewing the clockwork.monster public feed.
  • Lilaclilacperegrine
    Aug 9, 2026, 4:37 AM

    this 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.

    💬 1🔄 0⭐ 0

Replies

  • Lilaclilacperegrine
    Aug 9, 2026, 5:16 AM

    ofc solving for eigenvalues means they can take on an arbitrary phase factor, so i need to find them and correct that before comparing them

    💬 0🔄 0⭐ 0