SOTAVerified

Constituency Parsing

Constituency parsing aims to extract a constituency-based parse tree from a sentence that represents its syntactic structure according to a phrase structure grammar.

Example:

             Sentence (S)
                 |
   +-------------+------------+
   |                          |
 Noun (N)                Verb Phrase (VP)
   |                          |
 John                 +-------+--------+
                      |                |
                    Verb (V)         Noun (N)
                      |                |
                    sees              Bill

Recent approaches convert the parse tree into a sequence following a depth-first traversal in order to be able to apply sequence-to-sequence models to it. The linearized version of the above parse tree looks as follows: (S (N) (VP V N)).

Papers

Showing 150 of 204 papers

TitleStatusHype
DadmaTools: Natural Language Processing Toolkit for Persian LanguageCode2
Grammar-Constrained Decoding for Structured NLP Tasks without FinetuningCode2
On Parsing as TaggingCode1
Constituency Parsing with a Self-Attentive EncoderCode1
Challenges to Open-Domain Constituency ParsingCode1
Nested Named Entity Recognition with Partially-Observed TreeCRFsCode1
StructFormer: Joint Unsupervised Induction of Dependency and Constituency Structure from Masked Language ModelingCode1
ELIT: Emory Language and Information ToolkitCode1
Unsupervised Discontinuous Constituency Parsing with Mildly Context-Sensitive GrammarsCode1
N-ary Constituent Tree Parsing with Recursive Semi-Markov ModelCode1
Headed-Span-Based Projective Dependency ParsingCode1
Bottom-Up Constituency Parsing and Nested Named Entity Recognition with Pointer NetworksCode1
Fast and Accurate Neural CRF Constituency ParsingCode1
Multilingual Constituency Parsing with Self-Attention and Pre-TrainingCode1
TreeMix: Compositional Constituency-based Data Augmentation for Natural Language UnderstandingCode1
Learned Incremental Representations for ParsingCode1
Nested Named Entity Recognition as Latent Lexicalized Constituency ParsingCode1
Strongly Incremental Constituency Parsing with Graph Neural NetworksCode1
Improving Constituency Parsing with Span AttentionCode1
Unsupervised Latent Tree Induction with Deep Inside-Outside Recursive AutoencodersCode1
A Dependency Perspective on RST Discourse Parsing and Evaluation0
An Empirical Study for Vietnamese Constituency Parsing with Pre-training0
Do Transformers Parse while Predicting the Masked Word?0
Bilingually-Guided Monolingual Dependency Grammar Induction0
An Empirical Investigation of Statistical Significance in NLP0
A General-Purpose Algorithm for Constrained Sequential Inference0
Boosting for Efficient Model Selection for Syntactic Parsing0
An Empirical Investigation of Error Types in Vietnamese Parsing0
A Generative Parser with a Discriminative Recognition Algorithm0
A Warm Start and a Clean Crawled Corpus -- A Recipe for Good Language Models0
A Conditional Splitting Framework for Efficient Constituency Parsing0
Domain Adaptation for Dependency Parsing via Self-Training0
Effective Inference for Generative Neural Parsing0
An Empirical Comparison of Unsupervised Constituency Parsing Methods0
A Feature-Rich Constituent Context Model for Grammar Induction0
Discosuite - A parser test suite for German discontinuous structures0
DiffCloth: Diffusion Based Garment Synthesis and Manipulation via Structural Cross-modal Semantic Alignment0
Corpus-Based Induction of Syntactic Structure: Models of Dependency and Constituency0
Coreference Resolution in FreeLing 4.00
A treebank-based study on the influence of Italian word order on parsing performance0
Attentive Tensor Product Learning0
An Attempt to Develop a Neural Parser based on Simplified Head-Driven Phrase Structure Grammar on Vietnamese0
At Which Level Should We Extract? An Empirical Analysis on Extractive Document Summarization0
Cross-Lingual Constituency Parsing for Middle High German: A Delexicalized Approach0
Cross-lingual Constituency Parsing with Linguistic Typology Knowledge0
Discontinuity (Re) ^2-visited: A Minimalist Approach to Pseudoprojective Constituent Parsing0
Deep Inside-outside Recursive Autoencoder with All-span Objective0
DeepNL: a Deep Learning NLP pipeline0
A Warm Start and a Clean Crawled Corpus - A Recipe for Good Language Models0
Discriminative Strategies to Integrate Multiword Expression Recognition and Parsing0
Show:102550
← PrevPage 1 of 5Next →

Benchmark Results

#ModelMetricClaimedVerifiedStatus
1Hashing + XLNetF1 score96.43Unverified
2SAPar + XLNetF1 score96.4Unverified
3Label Attention Layer + HPSG + XLNetF1 score96.38Unverified
4Attach-Juxtapose Parser + XLNetF1 score96.34Unverified
5Head-Driven Phrase Structure Grammar Parsing (Joint) + XLNetF1 score96.33Unverified
6CRF Parser + RoBERTaF1 score96.32Unverified
7Hashing + BertF1 score96.03Unverified
8N-ary semi-markov + BERT-largeF1 score95.92Unverified
9NFC + BERT-largeF1 score95.92Unverified
10Head-Driven Phrase Structure Grammar Parsing (Joint) + BERTF1 score95.84Unverified
#ModelMetricClaimedVerifiedStatus
1Attach-Juxtapose Parser + BERTF1 score93.52Unverified
2SAPar + BERTF1 score92.66Unverified
3N-ary semi-markov + BERTF1 score92.5Unverified
4Hashing + BertF1 score92.33Unverified
5CRF Parser + BERTF1 score92.27Unverified
6Kitaev etal. 2019F1 score91.75Unverified
7CRF ParserF1 score89.8Unverified
8Zhou etal. 2019F1 score89.4Unverified
9Kitaev etal. 2018F1 score87.43Unverified
#ModelMetricClaimedVerifiedStatus
1CRF Parser + ElectraF1 score91.92Unverified
2CRF Parser + BERTF1 score91.55Unverified
3CRF ParserF1 score88.6Unverified
#ModelMetricClaimedVerifiedStatus
1SAParF183.26Unverified