We compare the performance of DCA with or without neighbor entities (i.e., 2-hop vs. 1-hop).
for eachê i ∈ S t , we collect its neighborhood N (ê i ) consisting of Wikipedia entities that have inlinks pointing toê i .