SOTAVerified

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 701725 of 1407 papers

TitleStatusHype
Similarity Based Genre Identification for POS Tagging Experts \& Dependency Parsing0
Stack-based Multi-layer Attention for Transition-based Dependency Parsing0
Structured Prediction via Learning to Search under Bandit Feedback0
Universal Dependencies are Hard to Parse -- or are They?0
Universal Dependencies for Portuguese0
Fast(er) Exact Decoding and Global Training for Transition-Based Dependency Parsing via a Minimal Feature SetCode0
A Simple LSTM model for Transition-based Dependency Parsing0
Joint Syntacto-Discourse Parsing and the Syntacto-Discourse TreebankCode0
Cross-Lingual Dependency Parsing for Closely Related Languages - Helsinki's Submission to VarDial 20170
An End-to-end Environment for Research Question-Driven Entity Extraction and Network Analysis0
Stanford's Graph-based Neural Dependency Parser at the CoNLL 2017 Shared Task0
Initial Explorations of CCG Supertagging for Universal Dependency Parsing0
From Raw Text to Universal Dependencies - Look, No Tags!0
CLCL (Geneva) DINN Parser: a Neural Network Dependency Parser Ten Years Later0
A non-DNN Feature Engineering Approach to Dependency Parsing -- FBAML at CoNLL 2017 Shared Task0
Tokenizing, POS Tagging, Lemmatizing and Parsing UD 2.0 with UDPipe0
Delexicalized transfer parsing for low-resource languages using transformed and combined treebanks0
A System for Multilingual Dependency Parsing based on Bidirectional LSTM Feature Representations0
A rule-based system for cross-lingual parsing of Romance languages with Universal Dependencies0
The parse is darc and full of errors: Universal dependency parsing with transition-based and graph-based algorithms0
NTNU-1@ScienceIE at SemEval-2017 Task 10: Identifying and Labelling Keyphrases with Conditional Random Fields0
Learning local and global contexts using a convolutional recurrent network model for relation classification in biomedical text0
A Fast and Lightweight System for Multilingual Dependency Parsing0
FA3L at SemEval-2017 Task 3: A ThRee Embeddings Recurrent Neural Network for Question Answering0
CoNLL 2017 Shared Task: Multilingual Parsing from Raw Text to Universal Dependencies0
Show:102550
← PrevPage 29 of 57Next →

Benchmark Results

#ModelMetricClaimedVerifiedStatus
1Label Attention Layer + HPSG + XLNetLAS96.26Unverified
2DMPar + XLNetLAS95.92Unverified
3ACELAS95.8Unverified
4Deep Biaffine + RoBERTaLAS95.75Unverified
5HPSG Parser (Joint) + XLNetLAS95.72Unverified
6MFVILAS95.34Unverified
7CVT + Multi-TaskLAS95.02Unverified
8RNG TransformerLAS95.01Unverified
9SpanRelLAS94.7Unverified
10CRFParLAS94.49Unverified
#ModelMetricClaimedVerifiedStatus
1UDPipe 2.0 + mBERT + FLAIRLAS84.6Unverified
2UDifyLAS80.43Unverified
3HIT-SCIRLAS75.84Unverified
4Stanford+LAS74.16Unverified
5TurkuNLPLAS73.28Unverified
6UDPipe 2.0LAS73.11Unverified
#ModelMetricClaimedVerifiedStatus
1BiLSTM-CRFF191.92Unverified
2SciBERT (SciVocab)F191.41Unverified
3SciBERT (Base Vocab)F191.26Unverified
#ModelMetricClaimedVerifiedStatus
1BiLSTM-CRFF192.84Unverified
2SciBERT (SciVocab)F192.46Unverified
3SciBERT (Base Vocab)F192.32Unverified
#ModelMetricClaimedVerifiedStatus
1SuPar-BERTweetLabelled Attachment Score83.4Unverified
2Ensemble (20)Labelled Attachment Score79.4Unverified
3spaCy-XLM-RoBERTaLabelled Attachment Score79.39Unverified
#ModelMetricClaimedVerifiedStatus
1CRFParLAS86.52Unverified
2Biaffine ParserLAS85.38Unverified
#ModelMetricClaimedVerifiedStatus
1CamemBERTLAS92.47Unverified
2UDifyLAS91.45Unverified
#ModelMetricClaimedVerifiedStatus
1CamemBERTLAS92.9Unverified
2UDifyLAS88.06Unverified
#ModelMetricClaimedVerifiedStatus
1CamemBERTLAS94.39Unverified
2UDifyLAS90.05Unverified
#ModelMetricClaimedVerifiedStatus
1CamemBERTLAS81.37Unverified
2UDifyLAS80.01Unverified
#ModelMetricClaimedVerifiedStatus
1MFVILAS91.69Unverified
#ModelMetricClaimedVerifiedStatus
1da_dacy_large_tftLAS88.44Unverified
#ModelMetricClaimedVerifiedStatus
1CRFParLAS72.33Unverified
#ModelMetricClaimedVerifiedStatus
1StanzaMacro F181.13Unverified