Due to the lack of annotated data, we approach this problem by performing clustering, which works in an unsupervised fashion.
we represent features (described later in this section) of each mention as a vector and measure the distance between two mentions using cosine distance.