{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/amr-parsing-as-sequence-to-graph-transduction","title":"AMR Parsing as Sequence-to-Graph Transduction","arxiv_id":"1905.08704","date":"2019-05-21","proceeding":"ACL 2019 7","authors":["Sheng Zhang","Xutai Ma","Kevin Duh","Benjamin Van Durme"],"abstract":"We propose an attention-based model that treats AMR parsing as sequence-to-graph transduction. Unlike most AMR parsers that rely on pre-trained aligners, external semantic resources, or data augmentation, our proposed parser is aligner-free, and it can be effectively trained with limited amounts of labeled AMR data. Our experimental results outperform all previously reported SMATCH scores, on both AMR 2.0 (76.3% F1 on LDC2017T10) and AMR 1.0 (70.2% F1 on LDC2014T12).","url_abs":"https://arxiv.org/abs/1905.08704v2","url_pdf":"https://arxiv.org/pdf/1905.08704v2.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"amr-parsing-as-sequence-to-graph-transduction","repo_url":"https://github.com/sheng-z/stog","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"amr-parsing","task_name":"AMR Parsing"},{"task_slug":"semantic-parsing","task_name":"Semantic Parsing"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/amr-parsing-on-ldc2014t12-1","task":"AMR Parsing","dataset":"LDC2014T12","model":"Two-stage Sequence-to-Graph Transducer","rank_in_archive_order":5,"of":12,"metrics":{"F1 Full":"70.2"},"uses_additional_data":false},{"leaderboard":"/sota/amr-parsing-on-ldc2014t12","task":"AMR Parsing","dataset":"LDC2014T12:","model":"Sequence-to-Graph Transduction","rank_in_archive_order":1,"of":5,"metrics":{"F1 Full":"0.70","F1 Newswire":"0.75"},"uses_additional_data":false},{"leaderboard":"/sota/amr-parsing-on-ldc2017t10","task":"AMR Parsing","dataset":"LDC2017T10","model":"Sequence-to-Graph Transduction","rank_in_archive_order":21,"of":27,"metrics":{"Smatch":"76.3"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/1905.08704","atlas_url":"https://app.syntology.ai/?focus=1905.08704","mcp":null,"developers":"https://syntology.ai/developers","held":true,"reason":"arxiv_id_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"agent_calls":[{"tool":"get_citation_path","arguments":{"paper_1":"1905.08704"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1905.08704\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1905.08704"},"call":"get_concepts_for_paper(arxiv_id=\"1905.08704\")"}],"by_repo":[{"repo":"sheng-z/stog","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"14121cf086298962e16d582ae439d5f055f406e69cc92211e46f3c13a052089f","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}