Steinar H. Gunderson discusses modern perfect hashing techniques for mapping a predefined set of strings to integers, focusing on optimizing performance for small sets. He critiques existing methods, particularly the use of PEXT instructions, and shares a solution inspired by the chess community's approach to avoid collisions in string hashing. The article includes code examples demonstrating his methods for handling specific string lengths efficiently.