Welcome to qokedy project!

This page describes programs and tools developed for decoding the Voynich Manuscript. It is based on William Whitaker's Words - Latin-English dictionary. meluhha.com/latin, latinlexicon.org and wiktionary.org were used to add long vowels (but still there are plenty of mistakes). qokedy heavily depends on EVA - alphabet designed by René Zandbergen and Gabriel Landini.

Currently you can download: While using of qokedy is straightforward, the output may seem somewhat confusing at first glance:
+ (0 sōl[sōl] (X 0 0 X 0 S > N+C1+C2 3 1 M+C 1+2 R+l))
+ sun; [ XXXAX]
    = (0 sōl[sōl] (X 0 0 X 0 S > N+C1+C2 3 1 M+C 1+2 R+l))
        + (0 āri[Ari] (N 0 0 X 2 R~T > ADJ+C1+C2 1 1 POS 1+2 R+i~i+l+r+t))
        + of, pertaining/belonging to; connected with; derived from; made of; -like; [XX]
            = (0 sōlāri[sōlAri] (X 0 0 X 0 S > ADJ+C1+C2 1 1 POS 1+2 R+i))
            = sun-, of/relating to the sun; [horogium solarium => sun-dial]; [ XXXEO]
                + (0 um[um] (ADJ 0 0 X 0 R > ~ ~ ~ M+ACC+S~ 1 F))
                    = (0 sōlārium[sōlArium] (X 0 0 X 0 S > ADJ+C1+C2 1 1 M+POS+ACC+S 1 F))
                + (0 um[um] (ADJ 0 0 X 1 R~T > ADV 0 0 POS 1 R~i+l+r+t))
                + -ly; [XX]
                    = (0 sōlārium[sōlArium] (X 0 0 X 0 S > ADV 0 0 POS 1 R))
                        + (0 ~ (ADV 0 0 POS 1 R > ~ ~ ~ ~ 1 F))
                            = (0 sōlārium[sōlArium] (X 0 0 X 0 S > ADV 0 0 POS 1 F))
        + (0 āri[Arī] (N 0 0 X 2 R~T > N+C1+C2 2 2 N 1+2 R+i~i+l+r+t))
        + -arium, -ary; place where; [XX]
            = (0 sōlāri[sōlArī] (X 0 0 X 0 S > N+C1+C2 2 2 N 1+2 R+i))
            = terrace; [ FXXEK]
                + (0 um[um] (N 2 0 X 2 R > ~ ~ ~ GEN+P~ 1 F))
                    = (0 sōlārium[sōlArīum] (X 0 0 X 0 S > N+C1+C2 2 2 N+GEN+P 1 F))
        + (0 āri[Arī] (N 0 0 X 2 R~T > N+C1+C2 2+4 1 M+C 1+2 R+i~i+l+r+t))
        + -er; -ist; dealer in thing, maker/artisan (argent.arius = money/silver changer); [XX]
            = (0 sōlāri[sōlArī] (X 0 0 X 0 S > N+C1+C2 2+4 1 M+C 1+2 R+i))
                + (0 um[um] (N 2 0 X 2 R > ~ ~ ~ GEN+P~ 1 F))
                    = (0 sōlārium[sōlArīum] (X 0 0 X 0 S > N+C1+C2 2+4 1 M+C+GEN+P 1 F))
                + (0 um[um] (N 4 0 X 2 R > ~ ~ ~ ACC+S~ 1 F))
                    = (0 sōlārium[sōlArīum] (X 0 0 X 0 S > N+C1+C2 2+4 1 M+C+ACC+S 1 F))
These results may be represented as tree where "+-lines" correspond to edges and "=-lines" correspond to nodes:

To read this mess one needs to understand the main concept of qokedy - transformation. Transformation is essentially a morpheme and is written in the form (penalty string (source > target)). string is morpheme attached. It can optionally include pronunciation in square brackets. penalty is penalty points for using the morpheme. We assign zero penalty for common morphemes, and increase penalty if morpheme is rare, invented, conjectured, or unusual in any other way. Morphemes are not attached arbitrarily. They mostly act on certain parts of speech only. These conditions are defined in source. target defines what we get after attaching morpheme.
Transformations basicly use classification system of Whitaker's Words. Also several new attributes where added. Here is the same output with all transformations highlighted:
+ (0 sōl[sōl] (X 0 0 X 0 S > N+C1+C2 3 1 M+C 1+2 R+l))
+ sun; [ XXXAX]
    = (0 sōl[sōl] (X 0 0 X 0 S > N+C1+C2 3 1 M+C 1+2 R+l))
        + (0 āri[Ari] (N 0 0 X 2 R~T > ADJ+C1+C2 1 1 POS 1+2 R+i~i+l+r+t))
        + of, pertaining/belonging to; connected with; derived from; made of; -like; [XX]
            = (0 sōlāri[sōlAri] (X 0 0 X 0 S > ADJ+C1+C2 1 1 POS 1+2 R+i))
            = sun-, of/relating to the sun; [horogium solarium => sun-dial]; [ XXXEO]
                + (0 um[um] (ADJ 0 0 X 0 R > ~ ~ ~ M+ACC+S~ 1 F))
                    = (0 sōlārium[sōlArium] (X 0 0 X 0 S > ADJ+C1+C2 1 1 M+POS+ACC+S 1 F))
                + (0 um[um] (ADJ 0 0 X 1 R~T > ADV 0 0 POS 1 R~i+l+r+t))
                + -ly; [XX]
                    = (0 sōlārium[sōlArium] (X 0 0 X 0 S > ADV 0 0 POS 1 R))
                        + (0 ~ (ADV 0 0 POS 1 R > ~ ~ ~ ~ 1 F))
                            = (0 sōlārium[sōlArium] (X 0 0 X 0 S > ADV 0 0 POS 1 F))
        + (0 āri[Arī] (N 0 0 X 2 R~T > N+C1+C2 2 2 N 1+2 R+i~i+l+r+t))
        + -arium, -ary; place where; [XX]
            = (0 sōlāri[sōlArī] (X 0 0 X 0 S > N+C1+C2 2 2 N 1+2 R+i))
            = terrace; [ FXXEK]
                + (0 um[um] (N 2 0 X 2 R > ~ ~ ~ GEN+P~ 1 F))
                    = (0 sōlārium[sōlArīum] (X 0 0 X 0 S > N+C1+C2 2 2 N+GEN+P 1 F))
        + (0 āri[Arī] (N 0 0 X 2 R~T > N+C1+C2 2+4 1 M+C 1+2 R+i~i+l+r+t))
        + -er; -ist; dealer in thing, maker/artisan (argent.arius = money/silver changer); [XX]
            = (0 sōlāri[sōlArī] (X 0 0 X 0 S > N+C1+C2 2+4 1 M+C 1+2 R+i))
                + (0 um[um] (N 2 0 X 2 R > ~ ~ ~ GEN+P~ 1 F))
                    = (0 sōlārium[sōlArīum] (X 0 0 X 0 S > N+C1+C2 2+4 1 M+C+GEN+P 1 F))
                + (0 um[um] (N 4 0 X 2 R > ~ ~ ~ ACC+S~ 1 F))
                    = (0 sōlārium[sōlArīum] (X 0 0 X 0 S > N+C1+C2 2+4 1 M+C+ACC+S 1 F))

For example transformation (0 sōl[sōl] (X 0 0 X 0 S > N+C1+C2 3 1 M+C 1+2 R+l)) attaches "sōl", yields masculine ("M") noun ("N") of third declension type 1 ("3 1") forms 1 and 2 ("1+2") and is applicable only as first transformation (due to attribute "S" in source section). In simple words it's root ("R").
Transformation (0 āri[Ari] (N 0 0 X 2 R~T > ADJ+C1+C2 1 1 POS 1+2 R+i~i+l+r+t)) adds "āri" and is applicable on second form ("2") of nouns of any declension ("N 0 0"). It produces forms 1 and 2 of adjective of first declension. This is obviously suffix.
Sum of these transformations is transformation (0 sōlāri[sōlAri] (X 0 0 X 0 S > ADJ+C1+C2 1 1 POS 1+2 R+i)) which (as naturally expected) is first transformation and yields adjective of first declension forms 1 and 2. Since this transformation acts as root (though strictly speaking it's not root) attribute "R" is also present.
For brevity description of other attributes (such as "i+l+r+t") is omitted.
Transformations are designed so that the addition operation is associative.

Last updated: 07.05.2023