We now show that the models are essentially equivalent if we ignore syntax: they component-wise multiply the second order vector of one word (target or context) with the first order vector of the other word.
we obtain the following derivations, where W = {w 1 , ..., w n } denotes the vocabulary, and V the symmetric n × n input matrix, where gives the co-occurrence association between words w i and w j : where < v, w> denotes scalar product.