{"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/neural-amr-sequence-to-sequence-models-for","title":"Neural AMR: Sequence-to-Sequence Models for Parsing and Generation","arxiv_id":"1704.08381","date":"2017-04-26","proceeding":"ACL 2017 7","authors":["Ioannis Konstas","Srinivasan Iyer","Mark Yatskar","Yejin Choi","Luke Zettlemoyer"],"abstract":"Sequence-to-sequence models have shown strong performance across a broad\nrange of applications. However, their application to parsing and generating\ntext usingAbstract Meaning Representation (AMR)has been limited, due to the\nrelatively limited amount of labeled data and the non-sequential nature of the\nAMR graphs. We present a novel training procedure that can lift this limitation\nusing millions of unlabeled sentences and careful preprocessing of the AMR\ngraphs. For AMR parsing, our model achieves competitive results of 62.1SMATCH,\nthe current best score reported without significant use of external semantic\nresources. For AMR generation, our model establishes a new state-of-the-art\nperformance of BLEU 33.8. We present extensive ablative and qualitative\nanalysis including strong evidence that sequence-based AMR models are robust\nagainst ordering variations of graph-to-sequence conversions.","url_abs":"http://arxiv.org/abs/1704.08381v3","url_pdf":"http://arxiv.org/pdf/1704.08381v3.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":"neural-amr-sequence-to-sequence-models-for","repo_url":"https://github.com/Cartus/DCGCN","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"mxnet","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"neural-amr-sequence-to-sequence-models-for","repo_url":"https://github.com/facebookresearch/m-amr2text","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"unanswered"}},{"paper_slug":"neural-amr-sequence-to-sequence-models-for","repo_url":"https://github.com/freesunshine0316/neural-graph-to-seq-mp","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok"}},{"paper_slug":"neural-amr-sequence-to-sequence-models-for","repo_url":"https://github.com/sinantie/NeuralAmr","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"torch","reach":{"status":"unanswered"}},{"paper_slug":"neural-amr-sequence-to-sequence-models-for","repo_url":"https://github.com/yangyucheng000/Papers/tree/main/amr2text","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"mindspore","reach":null}],"tasks":[{"task_slug":"amr-parsing","task_name":"AMR Parsing"},{"task_slug":"graph-to-sequence","task_name":"Graph-to-Sequence"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/amr-parsing-on-ldc2015e86-1","task":"AMR Parsing","dataset":"LDC2015E86","model":"SEQ2SEQ + 20M","rank_in_archive_order":6,"of":6,"metrics":{"Smatch":"62.1"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/1704.08381","atlas_url":"https://app.syntology.ai/?focus=1704.08381","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":"1704.08381"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1704.08381\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1704.08381"},"call":"get_concepts_for_paper(arxiv_id=\"1704.08381\")"}],"by_repo":[{"repo":"Cartus/DCGCN","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1806.09835"],"harvested_for_calls":[{"arxiv_id":"1806.09835","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1806.09835"},"call":"get_harvested_code_for_paper(arxiv_id=\"1806.09835\")"}]},{"repo":"facebookresearch/m-amr2text","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"freesunshine0316/neural-graph-to-seq-mp","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"sinantie/NeuralAmr","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"yangyucheng000/Papers","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_harvested_for_is":"harvested_for: the arXiv ids (as Syntology's graph holds them) of every paper whose samples Syntology's graph links to this repository, in arXiv-id order, complete; the page names the first 3 and says how many more. A link only: it does not say the papers are the same work, that one copied the other, or that the code implements this paper's method; harvested_for_calls gives the get_harvested_code_for_paper call for each arXiv-shaped id among them","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":"8dc04964d6dba8e09035406a66135f4749d3f0c6d40adc68c1842b79913f5bb6","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}