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 1–25 of 204 papers

TitleStatusHype
DadmaTools: Natural Language Processing Toolkit for Persian LanguageCode2
Grammar-Constrained Decoding for Structured NLP Tasks without FinetuningCode2
Multilingual Constituency Parsing with Self-Attention and Pre-TrainingCode1
Nested Named Entity Recognition with Partially-Observed TreeCRFsCode1
Unsupervised Latent Tree Induction with Deep Inside-Outside Recursive AutoencodersCode1
N-ary Constituent Tree Parsing with Recursive Semi-Markov ModelCode1
Fast and Accurate Neural CRF Constituency ParsingCode1
Challenges to Open-Domain Constituency ParsingCode1
Learned Incremental Representations for ParsingCode1
Nested Named Entity Recognition as Latent Lexicalized Constituency ParsingCode1
TreeMix: Compositional Constituency-based Data Augmentation for Natural Language UnderstandingCode1
Unsupervised Discontinuous Constituency Parsing with Mildly Context-Sensitive GrammarsCode1
StructFormer: Joint Unsupervised Induction of Dependency and Constituency Structure from Masked Language ModelingCode1
Strongly Incremental Constituency Parsing with Graph Neural NetworksCode1
Bottom-Up Constituency Parsing and Nested Named Entity Recognition with Pointer NetworksCode1
Constituency Parsing with a Self-Attentive EncoderCode1
On Parsing as TaggingCode1
ELIT: Emory Language and Information ToolkitCode1
Headed-Span-Based Projective Dependency ParsingCode1
Improving Constituency Parsing with Span AttentionCode1
A Generative Parser with a Discriminative Recognition Algorithm—0
An Empirical Study for Vietnamese Constituency Parsing with Pre-training—0
A Dependency Perspective on RST Discourse Parsing and Evaluation—0
An Empirical Investigation of Statistical Significance in NLP—0
A Warm Start and a Clean Crawled Corpus - A Recipe for Good Language Models—0
Show:102550
← PrevPage 1 of 9Next →

Benchmark Results

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