![]() |
|
questions to Torsten Timm about his paper - Printable Version +- The Voynich Ninja (https://www.voynich.ninja) +-- Forum: Voynich Research (https://www.voynich.ninja/forum-27.html) +--- Forum: Analysis of the text (https://www.voynich.ninja/forum-41.html) +--- Thread: questions to Torsten Timm about his paper (/thread-470.html) |
RE: questions to Torsten Timm about his paper - Davidsch - 18-05-2016 Torsten thank you but I have not studied that science and i can not follow, -"to count the number of steps needed to transform one word into another one"- that is why i asked a layman's example so i can understand it without having to study and plough through I understand your way of definition on the distance on letters If i compare two strings i can count the "Torsten Timm letter distances on the position of the maximum length of the biggest string". Which becomes only relevant if you have a proper "Torsten Timm letter distance table on the words" Even then it does not tell me much if it has not been compared to another language. So, i persist in the question: How do you compare, or what do you compare and what is the process or the result? If you want to be quick and plain: i am really quickly satisfied with 1 simple example. RE: questions to Torsten Timm about his paper - Torsten - 18-05-2016 RE: questions to Torsten Timm about his paper - Davidsch - 19-05-2016 RE: questions to Torsten Timm about his paper - Torsten - 19-05-2016 RE: questions to Torsten Timm about his paper - Davidsch - 19-05-2016 RE: questions to Torsten Timm about his paper - Andrey - 20-05-2016 RE: questions to Torsten Timm about his paper - Anton - 20-05-2016 RE: questions to Torsten Timm about his paper - Andrey - 21-05-2016 RE: questions to Torsten Timm about his paper - Davidsch - 19-08-2016 RE: questions to Torsten Timm about his paper - Davidsch - 31-10-2016 |