{"url":"/task/semantic-dependency-parsing","name":"Semantic Dependency Parsing","slug":"semantic-dependency-parsing","description_markdown":"Identify semantic relationships between words in a text using a graph representation.","categories":[{"name":"Natural Language Processing","url":"/area/natural-language-processing"}],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"derived"},"counts":{"papers_tagged":50,"papers_with_code":14,"benchmarks":3,"benchmark_tables_in_archive":3,"benchmark_tables_shown":3,"benchmark_tables_withheld_as_spam":0,"benchmark_definition":"a leaderboard table with at least one row; benchmark_tables_shown also counts the zero-row tables; benchmark_tables_in_archive adds the tables withheld as spam","datasets":0,"subtasks":0,"parent_tasks":1},"benchmarks":[{"leaderboard":"/sota/semantic-dependency-parsing-on-dm","slug":"semantic-dependency-parsing-on-dm","dataset":"DM","dataset_url":null,"rows_in_archive":4,"metrics":["In-domain","Out-of-domain"],"first_row_in_archive_order":{"model":"ACE","paper_title":"Automated Concatenation of Embeddings for Structured Prediction","paper_url":"/paper/automated-concatenation-of-embeddings-for-1","paper_date":"2020-10-10","arxiv_id":"2010.05006","code_links":[{"title":"Alibaba-NLP/ACE","url":"https://github.com/Alibaba-NLP/ACE"},{"title":"zhaoyuesun/phee","url":"https://github.com/zhaoyuesun/phee"}],"syntology":null}},{"leaderboard":"/sota/semantic-dependency-parsing-on-pas","slug":"semantic-dependency-parsing-on-pas","dataset":"PAS","dataset_url":null,"rows_in_archive":4,"metrics":["In-domain","Out-of-domain"],"first_row_in_archive_order":{"model":"ACE","paper_title":"Automated Concatenation of Embeddings for Structured Prediction","paper_url":"/paper/automated-concatenation-of-embeddings-for-1","paper_date":"2020-10-10","arxiv_id":"2010.05006","code_links":[{"title":"Alibaba-NLP/ACE","url":"https://github.com/Alibaba-NLP/ACE"},{"title":"zhaoyuesun/phee","url":"https://github.com/zhaoyuesun/phee"}],"syntology":null}},{"leaderboard":"/sota/semantic-dependency-parsing-on-psd","slug":"semantic-dependency-parsing-on-psd","dataset":"PSD","dataset_url":null,"rows_in_archive":4,"metrics":["In-domain","Out-of-domain"],"first_row_in_archive_order":{"model":"ACE","paper_title":"Automated Concatenation of Embeddings for Structured Prediction","paper_url":"/paper/automated-concatenation-of-embeddings-for-1","paper_date":"2020-10-10","arxiv_id":"2010.05006","code_links":[{"title":"Alibaba-NLP/ACE","url":"https://github.com/Alibaba-NLP/ACE"},{"title":"zhaoyuesun/phee","url":"https://github.com/zhaoyuesun/phee"}],"syntology":null}}],"datasets":[],"subtasks":[],"parent_tasks":[{"url":"/task/semantic-parsing","name":"Semantic Parsing"}],"papers":{"order":"repositories listed in the archive (desc), then date (desc); the archive holds no stars","population":"papers tagged with this task that list at least one repository in the archive","shown":14,"of":14,"tagged_in_all":50,"items":[{"url":"/paper/second-order-semantic-dependency-parsing-with","title":"Second-Order Semantic Dependency Parsing with End-to-End Neural Networks","date":"2019-06-19","arxiv_id":"1906.07880","repositories_listed":4,"syntology":null},{"url":"/paper/simpler-but-more-accurate-semantic-dependency","title":"Simpler but More Accurate Semantic Dependency Parsing","date":"2018-07-03","arxiv_id":"1807.01396","repositories_listed":3,"syntology":{"n":1,"n_ran":1,"n_unverified":0,"n_pointer_only":0}},{"url":"/paper/automated-concatenation-of-embeddings-for-1","title":"Automated Concatenation of Embeddings for Structured Prediction","date":"2020-10-10","arxiv_id":"2010.05006","repositories_listed":2,"syntology":null},{"url":"/paper/learning-joint-semantic-parsers-from-disjoint","title":"Learning Joint Semantic Parsers from Disjoint Data","date":"2018-04-17","arxiv_id":"1804.05990","repositories_listed":2,"syntology":null},{"url":"/paper/auxiliary-tasks-to-boost-biaffine-semantic-1","title":"Auxiliary Tasks to Boost Biaffine Semantic Dependency Parsing","date":"2024-02-12","arxiv_id":"2402.07682","repositories_listed":1,"syntology":null},{"url":"/paper/dyngl-sdp-dynamic-graph-learning-for-semantic","title":"DynGL-SDP: Dynamic Graph Learning for Semantic Dependency Parsing","date":"2022-10-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/specnfs-a-challenge-dataset-towards","title":"SpecNFS: A Challenge Dataset Towards Extracting Formal Models from Natural Language Specifications","date":"2022-06-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/a-higher-order-semantic-dependency-parser","title":"A Higher-Order Semantic Dependency Parser","date":"2022-01-27","arxiv_id":"2201.11312","repositories_listed":1,"syntology":null},{"url":"/paper/n-ltp-a-open-source-neural-chinese-language","title":"N-LTP: An Open-source Neural Language Technology Platform for Chinese","date":"2020-09-24","arxiv_id":"2009.11616","repositories_listed":1,"syntology":null},{"url":"/paper/semi-supervised-semantic-dependency-parsing","title":"Semi-Supervised Semantic Dependency Parsing Using CRF Autoencoders","date":"2020-07-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/transition-based-semantic-dependency-parsing","title":"Transition-based Semantic Dependency Parsing with Pointer Networks","date":"2020-05-27","arxiv_id":"2005.13344","repositories_listed":1,"syntology":null},{"url":"/paper/multi-task-semantic-dependency-parsing-with","title":"Multi-Task Semantic Dependency Parsing with Policy Gradient for Learning Easy-First Strategies","date":"2019-06-04","arxiv_id":"1906.01239","repositories_listed":1,"syntology":null},{"url":"/paper/backpropagating-through-structured-argmax","title":"Backpropagating through Structured Argmax using a SPIGOT","date":"2018-05-12","arxiv_id":"1805.04658","repositories_listed":1,"syntology":null},{"url":"/paper/deep-multitask-learning-for-semantic","title":"Deep Multitask Learning for Semantic Dependency Parsing","date":"2017-04-22","arxiv_id":"1704.06855","repositories_listed":1,"syntology":null}],"syntology_records":1,"syntology_note":"a paper without a record is not a recorded non-run: it may lack an arXiv id or simply be absent from the graph layer"},"description_links":{"kept":0,"unwrapped_to_text":0,"bare_urls_linked":0,"relative_images_dropped":0,"rule":"internal links are kept only when the target slug exists in the catalog"},"syntology":{"read_at":"2026-09-24T18:15:14+00:00","claim":"Per-sample execution status on synthesized fixtures ('ran N of M samples'); not a correctness claim and not a ranking signal.","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"}},"not_shown":{"libraries":"the archive has no per-task library table","trend_sparklines":"the Trend column of the benchmarks table was a rendered image; it is not in the archive","social_and_latest_sorts":"stars and social signals are not in the archive"}}