A known language under a homophonic cipher
Ruled out failed its test
The text is a known language under a homophonic/verbose cipher (several ciphertext units per plaintext letter), units being glyphs, slot-fillers, BPE tokens or whole words.
Files
4Links
| answers | Is it a cipher of a known language? | QST08JG2PB04SQP |
| against (from) | Homophonic substitution of five languages fails | EVD0D8GDP383XD5 |
| tests (from) | Form-function coupling (spelling vs context similarity): Spearman(form sim, context sim) top-300 words | RUN0D8EPN3P3Y5M |
| tests (from) | Form-function coupling (spelling vs context similarity): share of 5 nearest context-neighbours within edit distance 1 | RUN0D8EPNBG2T1M |
| tests (from) | Homophonic solver with planted-key controls and permutation null: held-out gap (own minus decoded), nats/char, best of 19 configurations | RUN0D8EPQSM4ZMN |
| tests (from) | Homophonic solver with planted-key controls and permutation null: held-out gap, six configurations re-run with the stronger frequency… | RUN0D8EQ0B24DHR |
| tests (from) | Homophonic solver with planted-key controls and permutation null: homophonic solver recovers planted 80-unit Latin key, no spaces | RUN0D8EPNKA3W8S |