In order to model the tag dependencies, the previous neural network models (Collobert et al., 2011;Zheng et al., 2013;Pei et al., 2014) introduce a transition matrix A, and each entry A ij is the score of the transformation from tag i ∈ T to tag j ∈ T .
the sentence-level score can be formulated as follows: where is the score for choosing tag t i for the i-th character by our proposed GRNN (Eq.