In this paper, we approach the word embedding task from a different perspective by formulating it as a ranking problem.
given a word w, we aim to output an ordered list (c 1 , c 2 , • • • ) of context words from C such that words that cooccur with w appear at the top of the list.