Dependency Parsing
Dependency parsing is the task of extracting a dependency parse of a sentence that represents its grammatical structure and defines the relationships between "head" words and words, which modify those heads.
Example:
root
|
| +-------dobj---------+
| | |
nsubj | | +------det-----+ | +-----nmod------+
+--+ | | | | | | |
| | | | | +-nmod-+| | | +-case-+ |
+ | + | + + || + | + | |
I prefer the morning flight through Denver
Relations among the words are illustrated above the sentence with directed, labeled arcs from heads to dependents (+ indicates the dependent).
Papers
Showing 1–10 of 1407 papers
All datasetsPenn TreebankUniversal DependenciesGENIA - LASGENIA - UASTweebankCoNLL-2009French GSDParTUTSequoia TreebankSpoken CorpusChinese TreebankDaNE
Benchmark Results
| # | Model | Metric | Claimed | Verified | Status |
|---|---|---|---|---|---|
| 1 | Label Attention Layer + HPSG + XLNet | LAS | 96.26 | — | Unverified |
| 2 | DMPar + XLNet | LAS | 95.92 | — | Unverified |
| 3 | ACE | LAS | 95.8 | — | Unverified |
| 4 | Deep Biaffine + RoBERTa | LAS | 95.75 | — | Unverified |
| 5 | HPSG Parser (Joint) + XLNet | LAS | 95.72 | — | Unverified |
| 6 | MFVI | LAS | 95.34 | — | Unverified |
| 7 | CVT + Multi-Task | LAS | 95.02 | — | Unverified |
| 8 | RNG Transformer | LAS | 95.01 | — | Unverified |
| 9 | SpanRel | LAS | 94.7 | — | Unverified |
| 10 | CRFPar | LAS | 94.49 | — | Unverified |