{"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/predicting-semantic-relations-using-global","title":"Predicting Semantic Relations using Global Graph Properties","arxiv_id":"1808.08644","date":"2018-08-27","proceeding":"EMNLP 2018 10","authors":["Yuval Pinter","Jacob Eisenstein"],"abstract":"Semantic graphs, such as WordNet, are resources which curate natural language\non two distinguishable layers. On the local level, individual relations between\nsynsets (semantic building blocks) such as hypernymy and meronymy enhance our\nunderstanding of the words used to express their meanings. Globally, analysis\nof graph-theoretic properties of the entire net sheds light on the structure of\nhuman language as a whole. In this paper, we combine global and local\nproperties of semantic graphs through the framework of Max-Margin Markov Graph\nModels (M3GM), a novel extension of Exponential Random Graph Model (ERGM) that\nscales to large multi-relational graphs. We demonstrate how such global\nmodeling improves performance on the local task of predicting semantic\nrelations between synsets, yielding new state-of-the-art results on the WN18RR\ndataset, a challenging version of WordNet link prediction in which \"easy\"\nreciprocal cases are removed. In addition, the M3GM model identifies\nmultirelational motifs that are characteristic of well-formed lexical semantic\nontologies.","url_abs":"http://arxiv.org/abs/1808.08644v1","url_pdf":"http://arxiv.org/pdf/1808.08644v1.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":"predicting-semantic-relations-using-global","repo_url":"https://github.com/yuvalpinter/m3gm","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[{"task_slug":"link-prediction","task_name":"Link Prediction"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/link-prediction-on-wn18rr","task":"Link Prediction","dataset":"WN18RR","model":"M3GM","rank_in_archive_order":17,"of":75,"metrics":{"Hits@1":"0.4537","Hits@10":"0.5902","MRR":"0.4983"},"uses_additional_data":false}],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"arxiv_id_not_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"by_repo":[{"repo":"yuvalpinter/m3gm","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":"32f646d2b174f488163098a5f2c52632fdd92e7c0ed19a8e159da32292bd8abc","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}