3260 papers • 126 benchmarks • 313 datasets
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)).
(Image credit: Open Source)
These leaderboards are used to track progress in constituency-parsing-19
Use these libraries to find constituency-parsing-19 models and implementations
No datasets available.
Adding a benchmark result helps the community track progress.