(The student may even succeed on some pairs that it has never been shown, thanks to n-gram clues.)
we measure the "goodness" of the updated L2 word embedding matrix F. For each pair p = (e,f ) 2 P, sort all the words in the entire L1 vocabulary according to their cosine similarity to the L2 word f , and let r p denote the rank of e. For example, if the student had managed to learn a matrix F whose embedding of f exactly equalled E's embedding of e, then r p would be 1.