The output is a polarity vector pol ∈ R |V | such that pol i is the polarity score for the i th candidate phrase (or the i th node in G).
we desire pol to have the following semantics: > 0 i th phrase has positive polarity < 0 i th phrase has negative polarity = 0 i th phrase has no sentiment Intuitively, the algorithm works by computing both a positive and a negative polarity magnitude for each node in the graph, call them pol + i and poli .