In this framework, given n puzzle options, we find the subset of n − 1 words of maximal similarity (given some similarity score), and return the excluded word as the odd-man-out.
define an embedding as a function that maps every word to a set (possibly empty) of real vectors.