Upon receiving (x, t) at test time, we compute f t (v x ) and find the most similar embeddings in Y V .
we find the top-k most similar embeddings, and take the most similar derived word that starts with the same 4 letters as the root word, and is not identical to it.