For the first solver, we also leverage the property that words with similar cooccurrence information are located closely in the word embedding space.
given the question word w q and the candidate words w i , we can find the answer by solving: where T is the set of candidate words.