Transition-based

Reported on 2 benchmarks across 1 task · 1 paper · 2 SOTA

Note: results are matched by exact model name. Different papers may use the same name for different model variants.

Natural Language Processing2 results

Semantic ParsingonSemEval 2019 Task 1
English-20K (open) F1· 2017-04-03
67.2
best: 76.7 (Constituent Tree Parsing (+BERT))
SOTA
A Transition-Based Directed Acyclic Graph Parser for UCCA arXiv:1704.00552
Semantic ParsingonSemEval 2019 Task 1
English-Wiki (open) F1· 2017-04-03
72.8
best: 80.5 (Constituent Tree Parsing (+BERT))
SOTA
A Transition-Based Directed Acyclic Graph Parser for UCCA arXiv:1704.00552