I don't know how Google's implementation of sets worked, but a simple implementation you could do yourself in a Jupiter notebook is to load up some pretrained word vectors, normalize all vectors, look up the vectors for all words in your seed set, take the mean of them, and then look for the nearest neighbours.

Stick it on a website and then the rest of the world can use it too!