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 101150 of 204 papers

TitleStatusHype
Shift-Reduce Constituency Parsing with Dynamic Programming and POS Tag Lattice0
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
Statistical Parsing by Machine Learning from a Classical Arabic Treebank0
Strategies for Contiguous Multiword Expression Analysis and Dependency Parsing0
Supervised Attention for Sequence-to-Sequence Constituency Parsing0
Syntactic Identification of Occurrences of Multiword Expressions in Text using a Lexicon with Dependency Structures0
Targeted aspect-based emotion analysis to detect opportunities and precaution in financial Twitter messages0
Temporal@ODIL project: Adapting ISO-TimeML to syntactic treebanks for the temporal annotation of spoken speech0
The Effect of Dependency Representation Scheme on Syntactic Language Modelling0
The French Social Media Bank: a Treebank of Noisy User Generated Content0
The LIGM-Alpage architecture for the SPMRL 2013 Shared Task: Multiword Expression Analysis and Dependency Parsing0
The Limitations of Limited Context for Constituency Parsing0
Top-down Tree Structured Decoding with Syntactic Connections for Neural Machine Translation and Parsing0
Unity in Diversity: A Unified Parsing Strategy for Major Indian Languages0
Universal Recurrent Neural Network Grammar0
Unsupervised Full Constituency Parsing with Neighboring Distribution Divergence0
Unsupervised Full Constituency Parsing with Neighboring Distribution Divergence0
Unsupervised Labeled Parsing with Deep Inside-Outside Recursive Autoencoders0
Unsupervised Parsing with S-DIORA: Single Tree Encoding for Deep Inside-Outside Recursive Autoencoders0
Vine Pruning for Efficient Multi-Pass Dependency Parsing0
Word Segmentation as Unsupervised Constituency Parsing0
Word Segmentation, Unknown-word Resolution, and Morphological Agreement in a Hebrew Parsing System0
A Conditional Splitting Framework for Efficient Constituency Parsing0
YNU Deep at SemEval-2018 Task 12: A BiLSTM Model with Neural Attention for Argument Reasoning Comprehension0
A Constituency Parsing Tree based Method for Relation Extraction from Abstracts of Scholarly Publications0
A Dependency Perspective on RST Discourse Parsing and Evaluation0
A Fast and Accurate Dependency Parser using Neural Networks0
A Feature-Rich Constituent Context Model for Grammar Induction0
A General-Purpose Algorithm for Constrained Sequential Inference0
A Generative Parser with a Discriminative Recognition Algorithm0
A Minimal Span-Based Neural Constituency Parser0
A Multi-Teraflop Constituency Parser using GPUs0
An Attempt to Develop a Neural Parser based on Simplified Head-Driven Phrase Structure Grammar on Vietnamese0
An Empirical Comparison of Unsupervised Constituency Parsing Methods0
An Empirical Investigation of Error Types in Vietnamese Parsing0
An Empirical Investigation of Statistical Significance in NLP0
An Empirical Study for Vietnamese Constituency Parsing with Pre-training0
A New Version of the Sk Treebank of Polish Harmonised with the Walenty Valency Dictionary0
Assigning Deep Lexical Types Using Structured Classifier Features for Grammatical Dependencies0
A treebank-based study on the influence of Italian word order on parsing performance0
Attentive Tensor Product Learning0
At Which Level Should We Extract? An Empirical Analysis on Extractive Document Summarization0
A Warm Start and a Clean Crawled Corpus -- A Recipe for Good Language Models0
A Warm Start and a Clean Crawled Corpus - A Recipe for Good Language Models0
Bilingually-Guided Monolingual Dependency Grammar Induction0
Boosting for Efficient Model Selection for Syntactic Parsing0
Chunking Clinical Text Containing Non-Canonical Language0
Cloze-driven Pretraining of Self-attention Networks0
Constituency Parsing of Bulgarian: Word- vs Class-based Parsing0
Constituency Parsing using LLMs0
Show:102550
← PrevPage 3 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