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

Recently AddedMost HypedMost ActiveNeeds VerificationMost Verified

Showing 51–100 of 204 papers

TitleStatusHype
Court Judgement Labeling Using Topic Modeling and Syntactic ParsingCode0
A Warm Start and a Clean Crawled Corpus - A Recipe for Good Language Models—0
Word Segmentation as Unsupervised Constituency Parsing—0
GrammarSHAP: An Efficient Model-Agnostic and Structure-Aware NLP Explainer—0
Phrase-aware Unsupervised Constituency Parsing—0
CPTAM: Constituency Parse Tree Aggregation MethodCode0
Investigating Non-local Features for Neural Constituency Parsing—0
Unsupervised Full Constituency Parsing with Neighboring Distribution Divergence—0
A Warm Start and a Clean Crawled Corpus -- A Recipe for Good Language Models—0
Semantics-Preserved Distortion for Personal Privacy Protection in Information Management—0
Multi-Source Cross-Lingual Constituency Parsing—0
Re-thinking Supertags in Linear Context-free Rewriting Systems for Constituency Parsing—0
Phrase-aware Unsupervised Constituency Parsing—0
Nested Named Entity Recognition as Latent Lexicalized Constituency Parsing—0
Unsupervised Full Constituency Parsing with Neighboring Distribution Divergence—0
Cross-lingual Constituency Parsing with Linguistic Typology Knowledge—0
Universal Recurrent Neural Network Grammar—0
Self-Attentive Constituency Parsing for UCCA-based Semantic Parsing—0
Investigating Non-local Features for Neural Constituency ParsingCode0
Dependency Induction Through the Lens of Visual PerceptionCode0
Improved Latent Tree Induction with Distant Supervision via Span ConstraintsCode0
Neural Machine Translation with Synchronous Latent Phrase Structure—0
BERT-Proof Syntactic Structures: Investigating Errors in Discontinuous Constituency ParsingCode0
A Conditional Splitting Framework for Efficient Constituency Parsing—0
Assessing the Use of Prosody in Constituency Parsing of Imperfect TranscriptsCode0
Neural Combinatory Constituency ParsingCode0
Recursive Tree Attention: Improving Semantic Representations with Syntactic Tree Structured Attention Mechanism—0
The Limitations of Limited Context for Constituency Parsing—0
Rule Augmented Unsupervised Constituency ParsingCode0
RL-GRIT: Reinforcement Learning for Grammar Inference—0
Learning Syntax from Naturally-Occurring BracketingsCode0
Genres, Parsers, and BERT: The Interaction Between Parsers and BERT Models in Cross-Genre Constituency Parsing in English and Swedish—0
On the Evolution of Syntactic Information Encoded by BERT's Contextualized Representations—0
Deep Inside-outside Recursive Autoencoder with All-span Objective—0
Unsupervised Parsing with S-DIORA: Single Tree Encoding for Deep Inside-Outside Recursive Autoencoders—0
Improving Sequence-to-Sequence Semantic Parser for Task Oriented DialogCode0
Span-based discontinuous constituency parsing: a family of exact chart-based algorithms with time complexities from O(n\^6) down to O(n\^3)—0
An Empirical Study for Vietnamese Constituency Parsing with Pre-training—0
Heads-up! Unsupervised Constituency Parsing via Self-Attention Heads—0
Latent Tree Learning with Ordered Neurons: What Parses Does It Produce?Code0
On the Role of Supervision in Unsupervised Constituency Parsing—0
Converting the Point of View of Messages Spoken to Virtual AssistantsCode0
Reusable Phrase Extraction Based on Syntactic Parsing—0
An Empirical Comparison of Unsupervised Constituency Parsing Methods—0
Efficient Constituency Parsing by Pointing—0
Qu'apporte BERT \`a l'analyse syntaxique en constituants discontinus ? Une suite de tests pour \'evaluer les pr\'edictions de structures syntaxiques discontinues en anglais (What does BERT contribute to discontinuous constituency parsing ? A test suite to evaluate discontinuous constituency structure predictions in English)—0
Multilingual Chart-based Constituency Parse Extraction from Pre-trained Language ModelsCode0
At Which Level Should We Extract? An Empirical Analysis on Extractive Document Summarization—0
Span-based discontinuous constituency parsing: a family of exact chart-based algorithms with time complexities from O(n^6) down to O(n^3)Code0
Learning Syntactic and Dynamic Selective Encoding for Document Summarization—0
Show:102550
← PrevPage 2 of 5Next →
All datasetsPenn TreebankCTB5CTB7ATB

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
8NFC + BERT-largeF1 score95.92—Unverified
9N-ary semi-markov + 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