29-12-2025, 09:59 AM
(This post was last modified: 29-12-2025, 10:06 AM by Jorge_Stolfi.)
In conclusion, the revised crust-mantle-core (CMC) model says that a word that fits the OKOKO model is valid if, after deleting the "O"s, it has the form
Q^q D^d X^x G^g H^h X^y D^e N^n
where
With these tighter rules, the statistics for the CMC level are
all gud bad % gud sec-type
------------ ------------ ------------ ----- ----------
5966.750000 5824.687500 142.062500 97.62 bio-parags
935.500000 904.750000 30.750000 96.71 cos-parags
7277.500000 7035.625000 241.875000 96.68 hea-parags
3157.375000 3034.875000 122.500000 96.12 heb-parags
2100.750000 2034.625000 66.125000 96.85 pha-parags
10095.250000 9665.500000 429.750000 95.74 str-parags
2832.375000 2721.125000 111.250000 96.07 unk-parags
32365.500000 31221.187500 1144.312500 96.46 tot-parags
That is, more than 96% of the words that fit the OKOKO model fit the CMC pattern above.
We also have that of the 33067.25 words that contain only valid EVA characters (no weirdos, "?", or the rare characters b g j u v w x z), 94.4% satisfy the rest of the model (parsing into elements, OKOKO structure, and CMC structure).
Maybe the revised model is too tight, and some fraction of the 5.6% rejected words are in fact valid. But the number seems compatible with the theory that those 5.6% are indeed errors -- by the Author, by the Scribe, by the Retracers, and by the transcribers. Especially words run together.
There probably are further rules relating the insertion of the "O"s in the CMC pattern. For instance, maybe we can require that a "Q" is always followed by at least one "O", and an "N" is almost always preceded by at least one "O". Said another way, maybe we can combine the OKOKO and CMC models in a single formula with rules that tie the number of "O"s in each slot to the presence or number of the other "Q", "D" etc elements.
All the best, --stolfi
Q^q D^d X^x G^g H^h X^y D^e N^n
where
- q,g,h,n may be 0 or 1;
- g+h at most 1 (there can be at most one gallows per word);
- q+d+e+n <= 3 (there can be at most three of Q, D, and N);
- x+h+y <= 2 (, there can be at most two benches, counting a platform gallows as one bench.)
With these tighter rules, the statistics for the CMC level are
all gud bad % gud sec-type
------------ ------------ ------------ ----- ----------
5966.750000 5824.687500 142.062500 97.62 bio-parags
935.500000 904.750000 30.750000 96.71 cos-parags
7277.500000 7035.625000 241.875000 96.68 hea-parags
3157.375000 3034.875000 122.500000 96.12 heb-parags
2100.750000 2034.625000 66.125000 96.85 pha-parags
10095.250000 9665.500000 429.750000 95.74 str-parags
2832.375000 2721.125000 111.250000 96.07 unk-parags
32365.500000 31221.187500 1144.312500 96.46 tot-parags
That is, more than 96% of the words that fit the OKOKO model fit the CMC pattern above.
We also have that of the 33067.25 words that contain only valid EVA characters (no weirdos, "?", or the rare characters b g j u v w x z), 94.4% satisfy the rest of the model (parsing into elements, OKOKO structure, and CMC structure).
Maybe the revised model is too tight, and some fraction of the 5.6% rejected words are in fact valid. But the number seems compatible with the theory that those 5.6% are indeed errors -- by the Author, by the Scribe, by the Retracers, and by the transcribers. Especially words run together.
There probably are further rules relating the insertion of the "O"s in the CMC pattern. For instance, maybe we can require that a "Q" is always followed by at least one "O", and an "N" is almost always preceded by at least one "O". Said another way, maybe we can combine the OKOKO and CMC models in a single formula with rules that tie the number of "O"s in each slot to the presence or number of the other "Q", "D" etc elements.
All the best, --stolfi