On Computability 1A – 723 views
In this document, we continue to deal with the topic of constraint satisfaction, which we use for pattern matching processing. In particular, we exemplarily examine the syntax of the Voynich Manuscript (VMS) to determine the most probable substitutions for the prevalent glyph patterns used in the script, assuming that the script encodes concrete plaintext language sentences. This method isn’t restricted to this particular manuscript but is universally applicable. It depends, however, on a prudential choice of the analysed syntactical patterns how explicit the reached results are. As for the VMS with its low character entropy and the assumed plaintext languages, these results are partially astonishingly distinct.
Download