If the word w is positive then the probability that the random walk hits a positive word is higher, and if w is negative then the probability that the random walk hits a negative word is higher.
to overcome this limitation, we use a Web-based distributional approach to find the set of related words to each OOV word.