k3search "log rithmbcd qsu wx z"
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:
k3search takes each word found in the dictionary files and generates the 26 possible K3 mixed alphbets from the keyword. Each alphabet is then compared to the keystring to see if it matches. If a match is found, the keyword and full mixed alphabet is printed. If multiple matches are found, all matches are printed.