Structured Numbers • Deterministic Attention • Explainable Compatibility • No Training
What this demonstrates
No training
Deterministic
Explainable
phi((m,a,s)) = m
ok
Attention Output
| rank | j |
m_j | a_j | s_j |
score | w_j |
m_term | a_term | s_term |
penalty | mismatch |
m_pct | a_pct | s_pct | pen_pct |
w_bar | phi_ok |
Score definition (Plain ASCII)