k3search "log rithmbcd qsu wx z"
The keystring must be entered as a K1 alphabet.
The dictionary must be laid out as a set of files, with each file containing a list of words (in any order) all of the same length, one word per line. The filenames must start with the string len and end with a 2 digit number describing the length of the words inside the file. For example, the file len04 could contain:
k4search takes each word found in the dictionary files and generates a K1 mixed alphabet. The keystring is then reordered based on the new K1 alphabet. An order value is calculated from the result of reordering the keystring. This order value is a measure of how many letters in the string are sequential. The keyword that generates the highest order value is printed.