Challenge: a number of differences have emerged between classical and modern constituency parsing approaches . structural components like grammars and feature-rich lexicons are becoming less central . recurrent neural networks have gained traction as a powerful and general purpose tool for representation .
Approach: They propose a model that implicitly learns to encode much of the same information as grammars and lexicons in the past.
Outcome: The proposed model outperforms state-of-the-art models under similar conditions.

Similar Papers

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.
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.
The Limitations of Limited Context for Constituency Parsing (2021.acl-long)

Copied to clipboard

Challenge: a language model that is syntax-aware can produce better samples, authors say . a recent study shows that neural approaches to syntax can perform unsupervised syntactic parsing .
Approach: They propose to incorporate syntax into neural approaches in NLP to produce better samples . they find that the first time neural approaches were able to perform unsupervised syntactic parsing .
Outcome: The proposed models can perform unsupervised syntactic parsing, but they are lagging behind . the proposed models are based on a sandbox of probabilistic context-free-grammars .
Cross-Domain Generalization of Neural Constituency Parsers (P19-1)

Copied to clipboard

Challenge: Neural parsers perform well on in-domain benchmarks, but their performance degrades in well-understood ways.
Approach: They analyze generalization on English and Chinese corpora to see if they can generalize to other domains.
Outcome: The proposed neural parsers perform better on in-domain benchmarks than on out-of-domain corpora.
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.
An Empirical Comparison of Unsupervised Constituency Parsing Methods (2020.acl-main)

Copied to clipboard

Challenge: Existing methods for unsupervised constituency parsing are inconsistent due to data preprocessing, lexicalization, and evaluation metrics.
Approach: They propose to standardize experimental settings for better comparability between methods . they compare existing methods with those proposed by decade-old models .
Outcome: The proposed methods perform better than decade-old models on English and Japanese, respectively, compared with decade- old models.
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.
Dynamic Head Selection for Neural Lexicalized Constituency Parsing (2025.acl-long)

Copied to clipboard

Challenge: Lexicalized parsing has traditionally been neglected in favor of unlexicalized, span-based methods.
Approach: They propose a latent lexicalization framework that dynamically infers lexicals from data without relying on predefined head-finding rules.
Outcome: The proposed model learns lexical dependencies directly from data, offering greater adaptability across languages and datasets.
Two Local Models for Neural Constituent Parsing (C18-1)

Copied to clipboard

Challenge: Non-local features have been shown crucial for statistical parsing, but local models can give highly competitive accuracies thanks to the power of dense neural input representations.
Approach: They propose to use local neural models for constituent parsing to capture dependencies between sub output structures and to exploit non-local features.
Outcome: The proposed model achieves labeled bracketing F1 scores of 92.4% on PTB and 87.3% on CTB 5.1.
On the Role of Supervision in Unsupervised Constituency Parsing (2020.emnlp-main)

Copied to clipboard

Challenge: Recent work on unsupervised constituency parsing uses labeled examples for tuning . a few-shot parser with labeles can outperform other approaches by a significant margin .
Approach: They propose to use as few labeled examples as possible for model development . they propose to train existing models on the same labeles they access .
Outcome: The proposed model outperforms other models on the WSJ development set by a significant margin . the proposed model can be further improved by augmentation and self-training .

What is GenGO?

GenGO is an NLP powered publication search system. It currenctly indexes 30k+ papers from ACL Anthology, and implements multi-aspect summarization, semantic search, and more!

Information

About
Limitations