Straight to the Tree: Constituency Parsing with Neural Syntactic Distance
About
In this work, we propose a novel constituency parsing scheme. The model predicts a vector of real-valued scalars, named syntactic distances, for each split position in the input sentence. The syntactic distances specify the order in which the split points will be selected, recursively partitioning the input, in a top-down fashion. Compared to traditional shift-reduce parsing schemes, our approach is free from the potential problem of compounding errors, while being faster and easier to parallelize. Our model achieves competitive performance amongst single model, discriminative parsers in the PTB dataset and outperforms previous models in the CTB dataset.
Yikang Shen, Zhouhan Lin, Athul Paul Jacob, Alessandro Sordoni, Aaron Courville, Yoshua Bengio• 2018
Related benchmarks
| Task | Dataset | Result | Rank | |
|---|---|---|---|---|
| Constituent Parsing | PTB (test) | F191.8 | 127 | |
| Constituent Parsing | CTB (test) | F1 Score86.5 | 45 | |
| Constituency Parsing | CTB 5.0 (test) | F1 Score86.5 | 19 | |
| Parsing | PTB (test) | Sents/sec351 | 17 | |
| Constituency Parsing | Chinese Treebank 5.1 (test) | F1 Score86.5 | 13 | |
| Constituency Parsing | PTB (test) | Speed (Sents/s)111 | 12 | |
| Constituency Parsing | PTB WSJ (Section 23 test) | F1 Score91.8 | 12 | |
| Syntactic Parsing | English Penn Treebank (test) | Speed (Sents/s)111 | 11 |
Showing 8 of 8 rows