DigiNews

Summary

The post discusses solving Semantle without relying on exact embedding models. It compares a hard-constraint approach using pairwise rankings to a probabilistic approach that preserves candidates, showing robustness across embedding spaces and resulting in roughly 100–200 guesses, with examples and code snippets.