Linguistic Patterns Before Decipherment: A Key to Understanding Unknown Texts
#20
What about  with alternative readings ("[:]") for example, f1 line 1 contains [cth:oto]

as nablator says with a regex of ([a-z]{1,10},  you will get 2 words 'cth' and 'oto'  and one of those does not exist.

similarly with  @lettters and words containing '?',  a word like "@130;tol" reduces to "tol" , which is not the original word and increases your token count of "tol" which then would be wrong.

If you are using words and counts to find patterns as with TF.;IDF then your results will have statistical artefacts which are not present in the vms.

If you've been using Takahashi then parsing ZL is a world of pain away Smile     theres a whole pdf about it You are not allowed to view links. Register or Login to view.
and a brief explanation here "voynich<dot>nu/transcr.html  -> Common transliteration file format",  found You are not allowed to view links. Register or Login to view.
[+] 1 user says Thank You to RobGea for this post
Reply


Messages In This Thread
RE: Linguistic Patterns Before Decipherment: A Key to Understanding Unknown Texts - by RobGea - 29-04-2025, 03:06 PM

Forum Jump:


Users browsing this thread: 3 Guest(s)