To summarize: Using our beam search algorithm in an iterative fashion, we are able to improve the state-of-the-art decipherment accuracy for word substitution ciphers.
given a set of symbols V eval with unigram counts N (v) for v ∈ V eval , and the total amount of running symbols the SER can be seen as a weighted form of the MER, emphasizing errors for frequent words.