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

TitleStatusHype
An Empirical Comparison of Unsupervised Constituency Parsing Methods0
Efficient Constituency Parsing by Pointing0
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 Summarization0
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 Summarization0
Unsupervised Discourse Constituency Parsing Using Viterbi EMCode0
Rethinking Self-Attention: Towards Interpretability in Neural ParsingCode0
Generalizing Natural Language Analysis through Span-relation RepresentationsCode0
Show:102550
← PrevPage 10 of 21Next →

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