{"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/knowledge-graph-generation-from-text","title":"Knowledge Graph Generation From Text","arxiv_id":"2211.10511","date":"2022-11-18","proceeding":null,"authors":["Igor Melnyk","Pierre Dognin","Payel Das"],"abstract":"In this work we propose a novel end-to-end multi-stage Knowledge Graph (KG) generation system from textual inputs, separating the overall process into two stages. The graph nodes are generated first using pretrained language model, followed by a simple edge construction head, enabling efficient KG extraction from the text. For each stage we consider several architectural choices that can be used depending on the available training resources. We evaluated the model on a recent WebNLG 2020 Challenge dataset, matching the state-of-the-art performance on text-to-RDF generation task, as well as on New York Times (NYT) and a large-scale TekGen datasets, showing strong overall performance, outperforming the existing baselines. We believe that the proposed system can serve as a viable KG construction alternative to the existing linearization or sampling-based graph generation approaches. Our code can be found at https://github.com/IBM/Grapher","url_abs":"https://arxiv.org/abs/2211.10511v1","url_pdf":"https://arxiv.org/pdf/2211.10511v1.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":"knowledge-graph-generation-from-text","repo_url":"https://github.com/ibm/grapher","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"graph-generation","task_name":"Graph Generation"},{"task_slug":"joint-entity-and-relation-extraction","task_name":"Joint Entity and Relation Extraction"},{"task_slug":"language-modeling","task_name":"Language Modeling"},{"task_slug":"language-modelling","task_name":"Language Modelling"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/joint-entity-and-relation-extraction-on-8","task":"Joint Entity and Relation Extraction","dataset":"WebNLG 3.0","model":"ReGen","rank_in_archive_order":2,"of":10,"metrics":{"F1":"72.3"},"uses_additional_data":false},{"leaderboard":"/sota/joint-entity-and-relation-extraction-on-8","task":"Joint Entity and Relation Extraction","dataset":"WebNLG 3.0","model":"Grapher (Text Nodes and Class Edges)","rank_in_archive_order":3,"of":10,"metrics":{"F1":"72.2"},"uses_additional_data":false},{"leaderboard":"/sota/joint-entity-and-relation-extraction-on-8","task":"Joint Entity and Relation Extraction","dataset":"WebNLG 3.0","model":"Amazon AI","rank_in_archive_order":6,"of":10,"metrics":{"F1":"68.9"},"uses_additional_data":false},{"leaderboard":"/sota/joint-entity-and-relation-extraction-on-8","task":"Joint Entity and Relation Extraction","dataset":"WebNLG 3.0","model":"BTS","rank_in_archive_order":8,"of":10,"metrics":{"F1":"68.2"},"uses_additional_data":false},{"leaderboard":"/sota/joint-entity-and-relation-extraction-on-8","task":"Joint Entity and Relation Extraction","dataset":"WebNLG 3.0","model":"CycleGT","rank_in_archive_order":9,"of":10,"metrics":{"F1":"34.2"},"uses_additional_data":false},{"leaderboard":"/sota/joint-entity-and-relation-extraction-on-8","task":"Joint Entity and Relation Extraction","dataset":"WebNLG 3.0","model":"Stanford OIE","rank_in_archive_order":10,"of":10,"metrics":{"F1":"15.8"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/2211.10511","atlas_url":"https://app.syntology.ai/?focus=2211.10511","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":"2211.10511"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2211.10511\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2211.10511"},"call":"get_concepts_for_paper(arxiv_id=\"2211.10511\")"}],"by_repo":[{"repo":"ibm/grapher","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":"d92b1077e2d9a665ed1c00517303afc56280270fbe5361754c03b688d34c086f","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}