I got the computer to find words with good anagrams and....!!
summary
A program that searches a dictionary for anagrams moves from a brute-force mapping that needed hours to a graph-based method that builds incompatibility edges and solves a maximum independent set to compute the minimum number of chunks. The new code processes a quarter-million-word list in about 3.5 seconds, filters out boring matches, and surfaces surprising hits like cinematographer ↔ megachiroptera (a giant bat).
AI-written summary · about
chapters (4)
related talks
08mComparing Apples and Oranges: Human and Computer Clustered Affinity Diagrams Under the Microscope
25mGraph Theory and Games: A Case Study on New York Times Connections
44mMirror, Mirror - What am I Typing Next? All About Auto Suggest
30mWords in Space
29mFrom Keyword Chaos to Clarity: Conquering a Complex Systematic Review with Python
01h 55mVocabulary Analysis of Job Descriptions
51mGoofing Off with Fun (Big) Data
22mA Scalable, Ensemble Approach for Building and Visualizing Deep Code-Sharing Networks