{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/paper/transomcs-from-linguistic-graphs-to","title":"TransOMCS: From Linguistic Graphs to Commonsense Knowledge","arxiv_id":"2005.00206","date":"2020-05-01","proceeding":null,"authors":["Hongming Zhang","Daniel Khashabi","Yangqiu Song","Dan Roth"],"abstract":"Commonsense knowledge acquisition is a key problem for artificial intelligence. Conventional methods of acquiring commonsense knowledge generally require laborious and costly human annotations, which are not feasible on a large scale. In this paper, we explore a practical way of mining commonsense knowledge from linguistic graphs, with the goal of transferring cheap knowledge obtained with linguistic patterns into expensive commonsense knowledge. The result is a conversion of ASER [Zhang et al., 2020], a large-scale selectional preference knowledge resource, into TransOMCS, of the same representation as ConceptNet [Liu and Singh, 2004] but two orders of magnitude larger. Experimental results demonstrate the transferability of linguistic knowledge to commonsense knowledge and the effectiveness of the proposed approach in terms of quantity, novelty, and quality. TransOMCS is publicly available at: https://github.com/HKUST-KnowComp/TransOMCS.","url_abs":"https://arxiv.org/abs/2005.00206v1","url_pdf":"https://arxiv.org/pdf/2005.00206v1.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":"transomcs-from-linguistic-graphs-to","repo_url":"https://github.com/HKUST-KnowComp/TransOMCS","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":null}],"tasks":[],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=2005.00206","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.00206"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-24T18:15:14+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"deterministic:regex_extraction","url":"https://github.com/HKUST-KnowComp/TransOMCS","reach":null}],"summary":{"ran_draft_wrong":2,"unverified":1},"by_repo_kind":{"official":{"samples":3,"ran":2,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":0,"samples":[{"code_sha256_prefix":"fc5dd5649cf17c8d","entry":"find_shortest_path","repo":"HKUST-KnowComp/TransOMCS","repo_kind":"official","path":"Pattern_Extraction.py","file_url":"https://github.com/HKUST-KnowComp/TransOMCS/blob/HEAD/Pattern_Extraction.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"fc5dd5649cf17c8d"}},{"code_sha256_prefix":"291b67cb4b958a76","entry":"path_to_pattern","repo":"HKUST-KnowComp/TransOMCS","repo_kind":"official","path":"Pattern_Extraction.py","file_url":"https://github.com/HKUST-KnowComp/TransOMCS/blob/HEAD/Pattern_Extraction.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"291b67cb4b958a76"}},{"code_sha256_prefix":"c57dfbbddabfbf4d","entry":"test","repo":"HKUST-KnowComp/TransOMCS","repo_kind":"official","path":"Train_and_Predict.py","file_url":"https://github.com/HKUST-KnowComp/TransOMCS/blob/HEAD/Train_and_Predict.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"c57dfbbddabfbf4d"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}