A weighted lexical graph is formed by connecting each word to its k nearest neighbors using cosine similarity.

A set of positive and negative seed words are chosen.

Propagate polarities from the seed set.

Create word scores with the help of negative and positive seed sets.

Use bootstrap sampling to assign confidence regions to the word score.