-JKP- > 01-10-2017, 12:26 AM
MarcoP > 01-10-2017, 10:28 AM
(30-09-2017, 10:23 PM)Koen Gh. Wrote: You are not allowed to view links. Register or Login to view.Marco, I took text from some pages and transcribed them taking into account some possible digraphs on the one hand and developing the benches on the other - a scenario I deem possible. It's obviously not a proposed solution, just a test to see what happens when the text is written this way. If possible, could you check which results your program gives for it?
(I kept EVA q as q, though it's clear that in this transcription it would take on a vowel value, likely one already represented differently elsewhere)
Koen G > 01-10-2017, 10:52 AM
MarcoP > 01-10-2017, 12:16 PM
(01-10-2017, 10:52 AM)Koen Gh. Wrote: You are not allowed to view links. Register or Login to view.Thanks, Marco!
I attach the folios I started from (taken from Takahashi). I selected these folios randomly, but from the same "language" to have some consistency.
It's basically EVA, but I made some changes to test digraphs and trigraphs. I came up with a way to represent "o+gallow" as a single glyph. It's always the voiced version of that gallow. So oT = D, oP = B, oK = G. Once again, this is not a proposed translation, just a way to test digraphs.
If you represent o+gallow as a consonant, eva q looks like it has to be a vowel.
I also replaced:
EVA in = n
EVA iin = m
EVA n = l
EVA l = s
EVA ee = u
The most interpretative part is that I developed the benches depending on their surroundings (though as consistently as possible). This can surely be done better, or at least differently. It would be interesting if we had a way to test how "optimal" a certain transcription is (with entropy?).
Koen G > 01-10-2017, 12:25 PM
ReneZ > 01-10-2017, 01:18 PM
Quote: / \
| A(11) A(12) |
| |
| A(21) A(22) |
\ /
Koen G > 01-10-2017, 01:46 PM
MarcoP > 01-10-2017, 01:51 PM
(01-10-2017, 01:18 PM)ReneZ Wrote: You are not allowed to view links. Register or Login to view.Marco,
from the figures you have shown, with the white and red characters against a black background, I conclude that the algorithm really goes ahead by assigning each character in the text to one of the possible states.
When doing this, it tries to maximise the consistency of having each character always being generated by the same state, but also to alternate as much as possible.
MarcoP > 01-10-2017, 02:04 PM
(01-10-2017, 01:46 PM)Koen Gh. Wrote: You are not allowed to view links. Register or Login to view.Wouldn't this also mean that the algorithm will perform poorly in languages which prefer large consonant clusters?
ReneZ > 01-10-2017, 02:10 PM