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

TitleStatusHype
Scene Graph Parsing as Dependency ParsingCode1
Cache Transition Systems for Graph Parsing0
On Extended Long Short-term Memory and Dependent Bidirectional Recurrent Neural NetworkCode0
SparseMAP: Differentiable Sparse Structured InferenceCode0
Non-Projective Dependency Parsing via Latent Heads Representation (LHR)Code0
Vietnamese Open Information Extraction0
Building an Ellipsis-aware Chinese Dependency Treebank for Web TextCode0
VnCoreNLP: A Vietnamese Natural Language Processing ToolkitCode0
Toward a Semantic Concordancer0
Surface Statistics of an Unknown Language Indicate How to Parse It0
Dependency Parsing of Code-Switching Data with Cross-Lingual Feature Representations0
Towards an open-source universal-dependency treebank for ErzyaCode0
Learning Representations Specialized in Spatial Knowledge: Leveraging Language and VisionCode0
A Learning Error Analysis for Structured Prediction with Approximate Inference0
Hybrid Oracle: Making Use of Ambiguity in Transition-based Chinese Dependency ParsingCode0
Robust Multilingual Part-of-Speech Tagging via Adversarial TrainingCode0
Ensemble Technique Utilization for Indonesian Dependency Parser0
Word Ordering as Unsupervised Learning Towards Syntactically Plausible Word RepresentationsCode0
Dependency Parsing with Partial Annotations: An Empirical Comparison0
Automatic Difficulty Assessment for Chinese Texts0
Deep Learning in Lexical Analysis and Parsing0
Non-Projective Dependency Parsing with Non-Local TransitionsCode0
BKTreebank: Building a Vietnamese Dependency Treebank0
DisSent: Sentence Representation Learning from Explicit Discourse RelationsCode0
Replicability Analysis for Natural Language Processing: Testing Significance with Multiple DatasetsCode0
An attentive neural architecture for joint segmentation and parsing and its application to real estate adsCode0
Similarity Based Genre Identification for POS Tagging Experts \& Dependency Parsing0
Universal Dependencies are Hard to Parse -- or are They?0
A Dependency Treebank for Kurmanji Kurdish0
Annotation of Clinical Narratives in Bulgarian language0
On the order of Words in Italian: a Study on Genre vs Complexity0
Hungarian Copula Constructions in Dependency Syntax and Parsing0
Segmentation Granularity in Dependency Representations for Korean0
Universal Dependencies for Portuguese0
Arc-Hybrid Non-Projective Dependency Parsing with a Static-Dynamic OracleCode0
Evaluating LSTM models for grammatical function labelling0
Prepositional Phrase Attachment over Word Embedding Products0
Enriching ASR Lattices with POS Tags for Dependency Parsing0
Effective Online Reordering with Arc-Eager Transitions0
Structured Prediction via Learning to Search under Bandit Feedback0
Lexicalized vs. Delexicalized Parsing in Low-Resource Scenarios0
Bounded-Depth High-Coverage Search Space for Noncrossing ParsesCode0
CUNI Experiments for WMT17 Metrics Task0
Hierarchical Word Structure-based Parsing: A Feasibility Study on UD-style Dependency Parsing in Japanese0
Exploiting Structure in Parsing to 1-Endpoint-Crossing Graphs0
Maximum Margin Reward Networks for Learning from Explicit and Implicit Supervision0
Efficient Discontinuous Phrase-Structure Parsing via the Generalized Maximum Spanning Arborescence0
Stack-based Multi-layer Attention for Transition-based Dependency Parsing0
Identifying Where to Focus in Reading Comprehension for Neural Question Generation0
Incremental Graph-based Neural Dependency Parsing0
Show:102550
← PrevPage 14 of 29Next →

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