Contrastive Learning on LLM Back Generation Treebank for Cross-domain Constituency Parsing (2025.acl-long)
Copied to clipboard
| Challenge: | Existing constituency treebanks are limited in out-of-domain settings, therefore constituency parsing is still a challenge. |
| Approach: | They propose a novel method for constituency parsing using large language models . they use a cross-domain constituency treebank to fill missing words with the incomplete one . |
| Outcome: | The proposed method achieves state-of-the-art performance on average compared with baselines on five target domains of MCTB. |
Similar Papers
LLM-enhanced Self-training for Cross-domain Constituency Parsing (2023.emnlp-main)
Copied to clipboard
| Challenge: | Existing approaches to self-training rely on limited and potentially low-quality raw corpora. |
| Approach: | They propose to enhance self-training with the large language model to generate domain-specific raw corpora iteratively and introduce grammar rules that guide the LLM in generating raw corporeals and establish criteria for selecting pseudo instances. |
| Outcome: | The proposed method outperforms traditional methods regardless of the large language model's performance. |
Data Augmentation for Cross-domain Parsing via Lightweight LLM Generation and Tree Hybridization (2025.coling-main)
Copied to clipboard
| Challenge: | Existing approaches for constituency parsing are expensive and lack high-quality labeled data. |
| Approach: | They propose a data augmentation method via lightweight large language model (LLM) generation and tree hybridization to generate a large number of structurally diverse instances. |
| Outcome: | The proposed method achieves significant improvements on five target domains with a lightweight LLM generation cost. |
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. |
Challenges to Open-Domain Constituency Parsing (2022.findings-acl)
Copied to clipboard
| Challenge: | Existing findings on cross-domain constituency parsing are only made on a limited number of domains. |
| Approach: | They manually annotate a high-quality constituency treebank containing five domains and analyze challenges to open-domain constituency parsing using a set of linguistic features. |
| Outcome: | The proposed model significantly improves the performance of the proposed model on the domain-variant features. |
Self-Correction Makes LLMs Better Parsers (2025.findings-emnlp)
Copied to clipboard
| Challenge: | Large language models (LLMs) have achieved remarkable success across various natural language processing tasks, but they still face challenges in performing fundamental NLP tasks, such as syntactic parsing. |
| Approach: | They propose a method that leverages grammar rules from existing treebanks to guide LLMs in correcting previous errors. |
| Outcome: | The proposed method significantly improves performance on in-domain and cross-domain datasets. |
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. |
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. |
Large Language Models Are No Longer Shallow Parsers (2024.acl-long)
Copied to clipboard
| Challenge: | Recent advances in large language models (LLMs) have reshaped the field of natural language processing (NLP) however, fundamental NLP tasks that involve linguistic analysis still play essential roles in the field. |
| Approach: | They propose to use constituency parsing to improve performance of LLMs on deep syntactic parse trees to prompt LLM chunking, filter out low-quality chunks and add remaining chunks to prompts to instruct LLM for parser. |
| Outcome: | The proposed approach improves LLMs' performance on constituency parsing on English and Chinese benchmark datasets. |
Treebank Embedding Vectors for Out-of-Domain Dependency Parsing (2020.acl-main)
Copied to clipboard
| Challenge: | a recent advance in monolingual dependency parsing is the idea of a treebank embedding vector . this allows the model to prefer training data from one treebank over another at test time . |
| Approach: | They propose a method to predict a treebank vector for sentences that do not come from a particular treebank . they also explore what happens when they move away from predefined treebank embedding vectors . |
| Outcome: | The proposed method can predict treebank vectors for sentences that do not come from a treebank used in training with sufficient accuracy for nine out of ten languages. |
On the Branching Bias of Syntax Extracted from Pre-trained Language Models (2020.findings-emnlp)
Copied to clipboard
| Challenge: | Existing methods for extracting constituency trees from language models suffer from branching bias. |
| Approach: | They propose to measure the branching bias by comparing the performance gap on a language and its reversed language. |
| Outcome: | The proposed method is agnostic to language models and extracting methods, and it can be implemented with three factors to introduce the branching bias. |