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
Grammar-Constrained Decoding for Structured NLP Tasks without FinetuningCode2
DadmaTools: Natural Language Processing Toolkit for Persian LanguageCode2
Multilingual Constituency Parsing with Self-Attention and Pre-TrainingCode1
ELIT: Emory Language and Information ToolkitCode1
Challenges to Open-Domain Constituency ParsingCode1
Nested Named Entity Recognition with Partially-Observed TreeCRFsCode1
On Parsing as TaggingCode1
StructFormer: Joint Unsupervised Induction of Dependency and Constituency Structure from Masked Language ModelingCode1
Fast and Accurate Neural CRF Constituency ParsingCode1
TreeMix: Compositional Constituency-based Data Augmentation for Natural Language UnderstandingCode1
Bottom-Up Constituency Parsing and Nested Named Entity Recognition with Pointer NetworksCode1
Nested Named Entity Recognition as Latent Lexicalized Constituency ParsingCode1
Unsupervised Latent Tree Induction with Deep Inside-Outside Recursive AutoencodersCode1
Learned Incremental Representations for ParsingCode1
Improving Constituency Parsing with Span AttentionCode1
Unsupervised Discontinuous Constituency Parsing with Mildly Context-Sensitive GrammarsCode1
Constituency Parsing with a Self-Attentive EncoderCode1
N-ary Constituent Tree Parsing with Recursive Semi-Markov ModelCode1
Headed-Span-Based Projective Dependency ParsingCode1
Strongly Incremental Constituency Parsing with Graph Neural NetworksCode1
An Empirical Study of Building a Strong Baseline for Constituency ParsingCode0
Neural Combinatory Constituency ParsingCode0
BERT-Proof Syntactic Structures: Investigating Errors in Discontinuous Constituency ParsingCode0
Multistage Collaborative Knowledge Distillation from a Large Language Model for Semi-Supervised Sequence GenerationCode0
Dependency Induction Through the Lens of Visual PerceptionCode0
Multilingual Chart-based Constituency Parse Extraction from Pre-trained Language ModelsCode0
Less Grammar, More FeaturesCode0
Learning Syntax from Naturally-Occurring BracketingsCode0
Cascading and Direct Approaches to Unsupervised Constituency Parsing on Spoken SentencesCode0
LLM-enhanced Self-training for Cross-domain Constituency ParsingCode0
Multilingual Lexicalized Constituency Parsing with Word-Level Auxiliary TasksCode0
Improving Unsupervised Constituency Parsing via Maximizing Semantic InformationCode0
Improving Sequence-to-Sequence Semantic Parser for Task Oriented DialogCode0
Investigating Non-local Features for Neural Constituency ParsingCode0
Court Judgement Labeling Using Topic Modeling and Syntactic ParsingCode0
Grammar as a Foreign LanguageCode0
Head-Driven Phrase Structure Grammar Parsing on Penn TreebankCode0
Improved Latent Tree Induction with Distant Supervision via Span ConstraintsCode0
Latent Tree Learning with Ordered Neurons: What Parses Does It Produce?Code0
Grammar Induction with Neural Language Models: An Unusual ReplicationCode0
Converting the Point of View of Messages Spoken to Virtual AssistantsCode0
CPTAM: Constituency Parse Tree Aggregation MethodCode0
Cross-Domain Generalization of Neural Constituency ParsersCode0
Assessing the Use of Prosody in Constituency Parsing of Imperfect TranscriptsCode0
Automatic Extraction of Clausal Embedding Based on Large-Scale English Text DataCode0
Ensemble Distillation for Unsupervised Constituency ParsingCode0
Gaussian Mixture Latent Vector GrammarsCode0
Effective Self-Training for ParsingCode0
Approximating CKY with TransformersCode0
Direct Output Connection for a High-Rank Language ModelCode0
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
8NFC + BERT-largeF1 score95.92Unverified
9N-ary semi-markov + 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