Baidu Dependency Parser

DDParser, or Baidu Dependency Parser, is a Chinese dependency parser trained on a large-scale manually labeled dataset called Baidu Chinese Treebank (DuCTB).

For inputs, for the i th word, its input vector eᵢ is the concatenation of the word embedding and character-level representation:

eᵢ=eᵢ^(w o r d) ⊕C h a r L S T M(wᵢ)

Where CharLSTM(wᵢ) is the output vectors after feeding the character sequence into a BiLSTM layer. The experimental results on DuCTB dataset show that replacing POS tag embeddings with CharLSTM(wᵢ) leads to the improvement.

For the BiLSTM encoder, three BiLSTM layers are employed over the input vectors for context encoding. Denote rᵢ the output vector of the top-layer BiLSTM for wᵢ

The dependency parser of Dozat and Manning is used. Dimension-reducing MLPs are applied to each recurrent output vector rᵢ before applying the biaffine transformation. Applying smaller MLPs to the recurrent output states before the biaffine classifier has the advantage of stripping away information not relevant to the current decision. Then biaffine attention is used both in the dependency arc classifier and relation classifier. The computations of all symbols in the Figure are shown below:

hᵢ^(d-a r c)=M L P^(d-a r c)(rᵢ) hᵢ^(h-a r c)=M L P^(h-a r c)(rᵢ) hᵢ^(d-r e l)=M L P^(d-r e l)(rᵢ) hᵢ^(h-r e l)=M L P^(h-r e l)(rᵢ) S^(a r c)=(H^(d-a r c) ⊕I) U^(a r c) H^(h-a r c) S^(r e l)=(H^(d-r e l) ⊕I) U^(r e l)((H^(h-r e l))ᵀ ⊕I)ᵀ

For the decoder, the first-order Eisner algorithm is used to ensure that the output is a projection tree. Based on the dependency tree built by biaffine parser, we get a word sequence through the in-order traversal of the tree. The output is a projection tree only if the word sequence is in order.