A Span-based Linearization for Constituent Trees
Not on the map. Why?
Abstract (arXiv)
We propose a novel linearization of a constituent tree, together with a new locally normalized model. For each split point in a sentence, our model computes the normalizer on all spans ending with that split point, and then predicts a tree span from them. Compared with global models, our model is fast and parallelizable. Different from previous local models, our linearization method is tied on the spans directly and considers more local features when performing span prediction, which is more interpretable and effective. Experiments on PTB (95.8 F1) and CTB (92.4 F1) show that our model significantly outperforms existing local models and efficiently achieves competitive results with global models.
Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). First posted on arXiv 30 Apr 2020.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 3; 2022: 2; 2023: 0; 2024: 1.
6 papers.
- 2021Bottom-Up Constituency Parsing and Nested Named Entity Recognition with Pointer Networkscited by 21
- 2021A Conditional Splitting Framework for Efficient Constituency Parsingcited by 7
- 2021Neural Combinatory Constituency Parsingcited by 1
- 2022Fast Rule-Based Decoding: Revisiting Syntactic Rules in Neural Constituency Parsingcited by 1
- 2024jp-evalb: Robust Alignment-based PARSEVAL Measurescited by 1
- 2022Order-sensitive Neural Constituency Parsingcited by 0
- 2024jp-evalb: Robust Alignment-based PARSEVAL Measures23 May 2024
- 2022Fast Rule-Based Decoding: Revisiting Syntactic Rules in Neural Constituency Parsing16 Dec 2022
- 2022Order-sensitive Neural Constituency Parsing1 Nov 2022
- 2021Bottom-Up Constituency Parsing and Nested Named Entity Recognition with Pointer Networks11 Oct 2021
- 2021A Conditional Splitting Framework for Efficient Constituency Parsing30 Jun 2021
- 2021Neural Combinatory Constituency Parsing12 Jun 2021