In this paper we have tackled the problem of finding a vector-space representation of words where, by construction, synonyms and antonyms are easy to distinguish.
we have defined a way of assigning sign to the entries in the co-occurrence matrix on which LSA operates, such that synonyms will tend to have positive cosine similarity, and antonyms will tend to have negative similarities.