{"url":"/sota/ucca-parsing-on-semeval-2019-task-1","task":{"name":"UCCA Parsing","url":"/task/ucca-parsing","note":null},"dataset":{"name":"SemEval 2019 Task 1","url":null},"category":"Natural Language Processing","categories":["Natural Language Processing"],"category_note":null,"description":"UCCA (Abend and Rappoport, 2013) is a semantic representation whose main design principles are ease of annotation, cross-linguistic applicability, and a modular architecture. UCCA represents the semantics of linguistic utterances as directed acyclic graphs (DAGs), where terminal (childless) nodes correspond to the text tokens, and non-terminal nodes to semantic units that participate in some super-ordinate relation. Edges are labeled, indicating the role of a child in the relation the parent represents. UCCA’s foundational layer mostly covers predicate-argument structure, semantic heads and inter-Scene relations. UCCA distinguishes primary edges, corresponding to explicit relations, from remote edges that allow for a unit to participate in several super-ordinate relations. Primary edges form a tree in each layer, whereas remote edges enable reentrancy, forming a DAG.\r\n\r\nDescription from [NLP Progress](http://nlpprogress.com/english/semantic_parsing.html)","description_from":"task","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","rank":"the archive's row order at snapshot; not re-ranked","rows_end_at":"2025-07-28","rows_withheld_as_spam":0,"metric_values":"the archive's strings, untouched"},"metrics":["English-Wiki (open) F1","English-20K (open) F1"],"metric_direction":{"note":"inferred from the metric name only (the archive records no direction); null = not inferred, chart draws points only","by_metric":{"English-Wiki (open) F1":"higher","English-20K (open) F1":"higher"}},"counts":{"rows":4,"rows_with_code":2,"rows_with_paper_page":4,"rows_dated":4,"rows_using_additional_data":0},"rows":[{"rank_in_archive_order":1,"model":"Constituent Tree Parsing (+BERT)","metrics":{"English-20K (open) F1":"76.7","English-Wiki (open) F1":"80.5"},"uses_additional_data":false,"paper_date":"2019-06-01","paper":"/paper/hltsuda-at-semeval-2019-task-1-ucca-graph-1","paper_url":"https://aclanthology.org/S19-2002","paper_title":"HLT@SUDA at SemEval-2019 Task 1: UCCA Graph Parsing as Constituent Tree Parsing","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":2,"model":"Neural Transducer","metrics":{"English-Wiki (open) F1":"76.6"},"uses_additional_data":false,"paper_date":"2019-09-05","paper":"/paper/broad-coverage-semantic-parsing-as","paper_url":"https://arxiv.org/abs/1909.02607v2","paper_title":"Broad-Coverage Semantic Parsing as Transduction","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":3,"model":"Transition-based + MTL","metrics":{"English-20K (open) F1":"68.4","English-Wiki (open) F1":"73.5"},"uses_additional_data":false,"paper_date":"2018-05-01","paper":"/paper/multitask-parsing-across-semantic","paper_url":"http://arxiv.org/abs/1805.00287v1","paper_title":"Multitask Parsing Across Semantic Representations","code":"https://github.com/danielhers/tupa","n_code_links":1,"syntology":null},{"rank_in_archive_order":4,"model":"Transition-based","metrics":{"English-20K (open) F1":"67.2","English-Wiki (open) F1":"72.8"},"uses_additional_data":false,"paper_date":"2017-04-03","paper":"/paper/a-transition-based-directed-acyclic-graph","paper_url":"http://arxiv.org/abs/1704.00552v2","paper_title":"A Transition-Based Directed Acyclic Graph Parser for UCCA","code":"https://github.com/danielhers/tupa","n_code_links":1,"syntology":null}],"since_archive":{"claim":"Results that newer papers report for their own method, placed here by Syntology. A model pointed at the cell in the paper's own table; the number was read from that cell and checked against this leaderboard's metric, dataset, split and scale; an independent check that saw this leaderboard's other rows and every other leaderboard on the same dataset accepted it. Not reviewed by the paper's authors or by the archive's editors, and not ranked against the archive rows.","extraction_file_present":true,"measurement":{"test_papers":883,"papers_with_output":881,"judged_true":108,"judged":110,"wilson95_lower":0.9361,"measured_on":"2026-09-24","frozen_commit":"0e3de0df94"},"measurement_note":"blind adjudication of accepted entries on a held-out split of archive papers, rules frozen before the test","coverage":{"sentence":"Syntology has checked 6,885 of the 9,623 papers on this site that are newer than the archive; results from the others appear after they are checked.","complete":false,"papers_newer_than_archive":9623,"papers_checked":6885,"papers_extracted_not_yet_verified":0,"boards_without_verdict":2,"papers_not_yet_extracted":2737},"order":"newest first by month (arXiv date, else the arXiv-id month), then arXiv id descending","columns":[],"entries":[]},"syntology":{"read_at":"2026-09-25T09:33:49+00:00","claim":"Per row: N of M harvested code samples from that row's paper executed on a synthesized fixture; the other M-N are unverified. Not a reproduction of the row's number; not a correctness claim. n_pointer_only_licence counts samples the site points at rather than redistributes (a licence axis, independent of ran/unverified).","rows_with_graph_line":0,"rows_with_any_sample_ran":0,"distinct_papers_with_graph_line":0,"distinct_papers_with_any_sample_ran":0,"samples_over_distinct_papers":{"n_ran":0,"n_unverified":0,"n_samples":0,"n_pointer_only_licence":0,"note":"each paper (arXiv id) counted once, however many rows it is behind; this is the page-level figure"},"samples_row_weighted":{"n_ran":0,"n_unverified":0,"n_samples":0,"n_pointer_only_licence":0,"note":"row-weighted: a paper behind several rows is counted once per row; inflated relative to samples_over_distinct_papers by design, kept for readers summing the per-row syntology blocks"}}}