A Conditional Splitting Framework for Efficient Constituency Parsing (2021.acl-long)
Copied to clipboard
| Challenge: | Developing efficient and effective parsing solutions has always been a key focus in NLP. |
| Approach: | They propose a generic seq2seq parsing framework that casts constituency parsers into a series of conditional splitting decisions. |
| Outcome: | The proposed framework outperforms state-of-the-art (SoTA) methods in discourse parsing . it is based on a syntactic and discourse parsed model and is linear in number of nodes . |
Similar Papers
RST Parsing from Scratch (2021.naacl-main)
Copied to clipboard
| Challenge: | Fig. 1 shows a document level discourse parser that performs top-down end-to-end parsing without requiring segmentation . |
| Approach: | They propose a top-down end-to-end formulation of document level discourse parsing in the Rhetorical Structure Theory framework. |
| Outcome: | The proposed model outperforms existing methods in end-to-end parsing and parse with gold segmentation without handcrafted features. |
Parsing Headed Constituencies (2024.lrec-main)
Copied to clipboard
| Challenge: | Using constituency and dependency trees, syntactic representations are preferred for tasks such as nominal phrase extraction and identification of terminology. |
| Approach: | They propose a parsing technique that generates headed constituency trees which combine information typically contained in constituency and dependency trees. |
| Outcome: | The proposed method generates headed constituency trees with discontinuities and can generate constituency tree with discontinuity. |
Straight to the Tree: Constituency Parsing with Neural Syntactic Distance (P18-1)
Copied to clipboard
| Challenge: | Compared to traditional shift-reduce parsing schemes, our approach is free from the potentially disastrous compounding error. |
| Approach: | They propose a model that predicts a scalar for each split position in a sentence and then determines the topology of grammar tree based on syntactic distances. |
| Outcome: | The proposed model achieves the state-of-the-art single model F1 score of 92.1 on PTB and 86.4 on CTB dataset, surpassing the previous single model results by a large margin. |
Efficient Constituency Parsing by Pointing (2020.acl-main)
Copied to clipboard
| Challenge: | Constituency parsing is a core task in natural language processing (NLP) Existing methods for constituency paring are greedy transition-based or globally optimized. |
| Approach: | They propose a constituency parsing model that casts the problem into a series of pointing tasks. |
| Outcome: | The proposed model achieves 92.78 F1 without pre-trained models, which is faster than existing models. |
Unsupervised Parsing via Constituency Tests (2020.emnlp-main)
Copied to clipboard
| Challenge: | Existing methods for unsupervised parsing rely on constituency tests . linguists can judge a sentence's grammatical validity by modifying it via some transformation . |
| Approach: | They propose a method for unsupervised parsing based on a constituency test . they specify a set of transformations and use an unsupervised neural acceptability model to make grammaticality decisions. |
| Outcome: | The proposed method achieves 62.8 F1 on the Penn Treebank test set, an improvement of 7.6 points over the previous best results. |
On Parsing as Tagging (2022.emnlp-main)
Copied to clipboard
| Challenge: | Existing approaches to reduce constituency parsing to tagging are based on linearization, learning, and decoding . linearization of the derivation tree is the most critical factor in achieving accurate parsers as taggers . |
| Approach: | They propose a pipeline with three steps for reducing constituency parsing to tagging . they find that linearization and learning are critical factors for accurate parsers . |
| Outcome: | The proposed pipelines are linearized, learning, and decoded, and have three steps to achieve accurate parsing as taggers. |
An Empirical Study of Building a Strong Baseline for Constituency Parsing (P18-2)
Copied to clipboard
| Challenge: | Sequence-to-sequence models have been used for natural language generation tasks such as machine translation and summarization. |
| Approach: | They propose to build a strong baseline based on general purpose sequence-to-sequence models for constituency parsing. |
| Outcome: | The proposed model outperforms existing models in natural language generation tasks without any explicit task-specific knowledge or architecture of constituent parsing. |
Don’t Parse, Choose Spans! Continuous and Discontinuous Constituency Parsing via Autoregressive Span Selection (2023.acl-long)
Copied to clipboard
| Challenge: | Constituency parsing is a fundamental task in natural language processing, having many applications in downstream tasks such as language modeling. |
| Approach: | They propose a simple and unified approach for both continuous and discontinuous constituency parsing via autoregressive span selection. |
| Outcome: | The proposed model can predict all possible continuous and discontinuous constituency trees without sacrificing data coverage and without expensive chart-based parsing algorithms. |
Top-down Discourse Parsing via Sequence Labelling (2021.eacl-main)
Copied to clipboard
| Challenge: | Discourse analysis is a systematic way to understand how texts are segmented hierarchically into discourse units. |
| Approach: | They propose a top-down approach to discourse parsing that is conceptually simpler than its predecessors. |
| Outcome: | The proposed model eliminates the decoder and reduces the search space for splitting points. |
Revisiting the Practical Effectiveness of Constituency Parse Extraction from Pre-trained Language Models (2022.coling-1)
Copied to clipboard
| Challenge: | Constituency Parse Extraction from Pre-trained Language Models (CPE-PLM) is a new paradigm that attempts to induce constituency parse trees based on the internal knowledge of pre-tried language models. |
| Approach: | They propose to use constituency parse trees from pre-trained language models to induce constituency trees by introducing a set of heterogeneous PLMs combined using two advanced ensemble methods. |
| Outcome: | The proposed approach is more effective than typical supervised parsers in few-shot settings. |