Challenge: Constituency parsers have been able to achieve competitive performance by using local features.
Approach: They propose to inject non-local features into the training process of a local span-based parser by predicting constituent n-gram non-local patterns and ensuring consistency between constituents and local constituents.
Outcome: The proposed method outperforms the self-attentive parser in multi-lingual and zero-shot cross-domain settings.

Similar Papers

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.
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.
Improving Constituency Parsing with Span Attention (2020.findings-emnlp)

Copied to clipboard

Challenge: Constituency parsing is a fundamental task for natural language understanding . n-grams are a conventional type of feature for contextual information . experimental results show that neural parsers with no grammar rules outperform statistical ones .
Approach: They propose to incorporate n-grams into span representations by weighting them according to their contributions to the parsing process.
Outcome: The proposed approach outperforms existing statistical grammar-based models on Arabic, Chinese, and English datasets.
What’s Going On in Neural Constituency Parsers? An Analysis (N18-1)

Copied to clipboard

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.
Co-training an Unsupervised Constituency Parser with Weak Supervision (2022.findings-acl)

Copied to clipboard

Challenge: Existing methods for unsupervised parsing that use bootstrapping classifiers to identify if a node dominates a span are lacking.
Approach: They propose a method for unsupervised parsing that relies on bootstrapping classifiers to identify if a node dominates a specific span.
Outcome: The proposed method achieves 63.1 F1 on the English test set and new state-of-the-art on treebanks for Chinese and Japanese.
Multilingual Chart-based Constituency Parse Extraction from Pre-trained Language Models (2021.findings-emnlp)

Copied to clipboard

Challenge: Existing methods for extracting complete (binary) parses from pre-trained language models are expensive and time-consuming.
Approach: They propose a chart-based method and an effective top-K ensemble technique to extractbinary parses from PLMs.
Outcome: The proposed method can induce non-trivial parses for sentences from nine languages in an integrated and language-agnostic manner, and is robust to cross-lingual transfer.
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.
Constituency Parsing with a Self-Attentive Encoder (P18-1)

Copied to clipboard

Challenge: Recent work on LSTM encoders based on recurrent neural networks has led to improvements in constituency parsing accuracy.
Approach: They propose to replace an LSTM encoder with a self-attentive architecture to improve a discriminative constituency parser.
Outcome: The proposed model outperforms the previous best-published results on 8 of the 9 languages in the SPMRL dataset.
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 .
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.

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