Shift-Reduce Constituent Parsing with Neural Lookahead Features
About
Transition-based models can be fast and accurate for constituent parsing. Compared with chart-based models, they leverage richer features by extracting history information from a parser stack, which spans over non-local constituents. On the other hand, during incremental parsing, constituent information on the right hand side of the current word is not utilized, which is a relative weakness of shift-reduce parsing. To address this limitation, we leverage a fast neural model to extract lookahead features. In particular, we build a bidirectional LSTM model, which leverages the full sentence information to predict the hierarchy of constituents that each word starts and ends. The results are then passed to a strong transition-based constituent parser as lookahead features. The resulting parser gives 1.3% absolute improvement in WSJ and 2.3% in CTB compared to the baseline, given the highest reported accuracies for fully-supervised parsing.
Related benchmarks
| Task | Dataset | Result | Rank | |
|---|---|---|---|---|
| Constituent Parsing | PTB (test) | F194.2 | 127 | |
| Phrase-structure parsing | PTB (§23) | F1 Score91.7 | 56 | |
| Constituency Parsing | Penn Treebank WSJ (section 23 test) | F1 Score91.7 | 55 | |
| Constituent Parsing | CTB (test) | F1 Score85.5 | 45 | |
| Parsing | PTB (test) | Sents/sec79.2 | 17 | |
| Constituency Parsing | PTB WSJ (Section 23 test) | F1 Score91.8 | 12 |