Besides these state-of-the-art techniques, a few ranking-based approaches have been proposed for word embedding recently, e.g., (Collobert and Weston, 2008;Vilnis and McCallum, 2015;Liu et al., 2015).
all of them adopt a pair-wise binary classification approach with a linear ranking loss ρ 0 .