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

TitleStatusHype
Automatic Extraction of Clausal Embedding Based on Large-Scale English Text DataCode0
Revisiting Absence withSymptoms that *T* Show up Decades Later to Recover Empty Categories0
An Attempt to Develop a Neural Parser based on Simplified Head-Driven Phrase Structure Grammar on Vietnamese0
Improving Unsupervised Constituency Parsing via Maximizing Semantic InformationCode0
Entity-Aware Biaffine Attention Model for Improved Constituent Parsing with Reduced Entity Violations0
Structural Optimization Ambiguity and Simplicity Bias in Unsupervised Neural Grammar InductionCode0
To be Continuous, or to be Discrete, Those are Bits of QuestionsCode0
jp-evalb: Robust Alignment-based PARSEVAL Measures0
Unsupervised Parsing by Searching for Frequent Word Sequences among Sentences with Equivalent Predicate-Argument Structures0
Targeted aspect-based emotion analysis to detect opportunities and precaution in financial Twitter messages0
Show:102550
← PrevPage 1 of 21Next →

Benchmark Results

#ModelMetricClaimedVerifiedStatus
1SAParF183.26Unverified