29. The non-transitory computer-readable medium of claim 28 , wherein to map to the AH-S geometry, the machine-readable program code causes, when executed, one or more devices to perform the following functions: map to a unique point for each candidate OCR-Key and its respective set of OCR-Key anagrams; map to orthogonal groups of candidate OCR-Keys and their set of respective anagrams, wherein the orthogonal groups differ from the registered machine code OCR-Key by one or more of a character shape class deletion, a character shape class substitution, and a character shape class insertion, and register the cardinality, wherein the cardinality of a character shape class may vary with the unique points and the orthogonal groups.
29. The non-transitory computer-readable medium of claim 28 , wherein to map to the AH-S geometry, the machine-readable program code causes, when executed, one or more devices to perform the following functions: map to a unique point for each candidate OCR-Key and its respective set of OCR-Key anagrams; map to orthogonal groups of candidate OCR-Keys and their set of respective anagrams, wherein the orthogonal groups differ from the registered machine code OCR-Key by one or more of a character shape class deletion, a character shape class substitution, and a character shape class insertion, and register the cardinality, wherein the cardinality of a character shape class may vary with the unique points and the orthogonal groups. 30. The non-transitory computer-readable medium of claim 29 , wherein to calculate a set of errors between the second set of candidate words and the registered OCR machine code and the OCR-Key, the machine-readable program code causes, when executed, one or more devices to perform the following functions: calculate a first Levenshtein-Distance (LD) measure between the second set of candidate words and the registered OCR machine code; and calculate a second Levenshtein-Distance (LD/OCR-Key) measure between the second set of candidate words and the OCR-Key.