14-04-2019, 02:37 PM
As far as I understand limited analysis has been conducted on the subset of Voynichese termed by some as labelese.
It would be nice to rerun many of the statistical or other analyses of the text just for labelese, so as to see where there are similarities and differences between labelese and non-labelese text. In addition I am interested in the study of labelese in its own right as I contest this ought to be Voynichese in its simplest form and so the most amenable to efforts to decipher it.
However I wonder how easy it is to distinguish between labels and non-labels in whichever file the complete text in stored. Presumably single word labels could be viewed as sentences or paragraphs with only one word in them. Then I don't know if it is easy to get hold of the source code for the various tests the seem as possibly being relevant and modifying the code to run just for the labelese subset; reproducing all the code could prove to be quite a hassle, so it would be nice if I can avoid that. I don't doubt this is more difficult to do than my description, but at some stage, when I have the time, I would like execute as many relevant tests as possible on labelese.(It may at times be unclear as to what is sentence text and what constitute single word labels).
I have not worked yet with the Voynich text file (s) or database or however else the text is stored and am pretty ignorant on EVA etc. However I am perfectly happy working with code, databases etc. so I am not daunted by that.
Any opinions on how easy/hard it will be to do this given the way data is stored and existing code made available, would be worth knowing.
It would be nice to rerun many of the statistical or other analyses of the text just for labelese, so as to see where there are similarities and differences between labelese and non-labelese text. In addition I am interested in the study of labelese in its own right as I contest this ought to be Voynichese in its simplest form and so the most amenable to efforts to decipher it.
However I wonder how easy it is to distinguish between labels and non-labels in whichever file the complete text in stored. Presumably single word labels could be viewed as sentences or paragraphs with only one word in them. Then I don't know if it is easy to get hold of the source code for the various tests the seem as possibly being relevant and modifying the code to run just for the labelese subset; reproducing all the code could prove to be quite a hassle, so it would be nice if I can avoid that. I don't doubt this is more difficult to do than my description, but at some stage, when I have the time, I would like execute as many relevant tests as possible on labelese.(It may at times be unclear as to what is sentence text and what constitute single word labels).
I have not worked yet with the Voynich text file (s) or database or however else the text is stored and am pretty ignorant on EVA etc. However I am perfectly happy working with code, databases etc. so I am not daunted by that.
Any opinions on how easy/hard it will be to do this given the way data is stored and existing code made available, would be worth knowing.