An Exact A* Method for Deciphering Letter-Substitution Ciphers. - Eric Corlett; Gerald Penn (ACL, 2010)

Why Letter Substitution Puzzles are Not Hard to Solve: A Case Study in Entropy and Probabilistic Search-Complexity. - Eric Corlett; Gerald Penn (MOL, 2013)

Reanalyzing the Most Probable Sentence Problem: A Case Study in Explicating the Role of Entropy in Algorithmic Complexity. - Eric Corlett; Gerald Penn (EACL, 2021)

Using Roark-Hollingshead Distance to Probe BERT's Syntactic Competence. - Jingcheng Niu; Wenjie Lu; Eric Corlett; Gerald Penn (BlackboxNLP@EMNLP, 2022)