Using such a relational feature catches two birds with one stone: firstly, it integrates the internal structure of a mention into the algorithm, which<cite> Rahman and Ng (2011)</cite> ignore; secondly, it captures dependencies between parent and child classification, which would not be possible if we integrated the internal structure via flat features or additional tree kernels.