Stack-Pointer Networks for Dependency Parsing
Table 1: UAS and LAS of four versions of our model on test sets for three languages, together with top-performing parsing systems. “T” and “G” indicate transition- and graph-based models, respectively. For BiAF, we provide the original results reported in Dozat and Manning (2017) and our re-implementation. For StackPtr and our re-implementation of BiAF, we report the average over 5 runs.
['[BOLD] System', '[EMPTY]', '[BOLD] English UAS', '[BOLD] English LAS', '[BOLD] Chinese UAS', '[BOLD] Chinese LAS', '[BOLD] German UAS', '[BOLD] German LAS']
Note that the results of StackPtr and our re-implementation of BiAF are the average of 5 repetitions instead of a single run. Our Full model significantly outperforms all the transition-based parsers on all three languages, and achieves better results than most graph-based parsers. Our model achieves state-of-the-art performance on both UAS and LAS on Chinese, and best UAS on English. On German, the performance is competitive with BiAF, and significantly better than other models.