Papers › Commonsense Knowledge Base Completion with Structural and Semantic Context

Commonsense Knowledge Base Completion with Structural and Semantic Context

7 Oct 2019arXiv:1910.02915archive 2025-07-28

Chaitanya Malaviya, Chandra Bhagavatula, Antoine Bosselut, Yejin Choi

Automatic KB completion for commonsense knowledge graphs (e.g., ATOMIC and ConceptNet) poses unique challenges compared to the much studied conventional knowledge bases (e.g., Freebase). Commonsense knowledge graphs use free-form text to represent nodes, resulting in orders of magnitude more nodes compared to conventional KBs (18x more nodes in ATOMIC compared to Freebase (FB15K-237)). Importantly, this implies significantly sparser graph structures - a major challenge for existing KB completion methods that assume densely connected graphs over a relatively smaller set of nodes. In this paper, we present novel KB completion models that can address these challenges by exploiting the structural and semantic context of nodes. Specifically, we investigate two key ideas: (1) learning from local graph structure, using graph convolutional networks and automatic graph densification and (2) transfer learning from pre-trained language models to knowledge graphs for enhanced contextual representation of knowledge. We describe our method to incorporate information from both these sources in a joint model and provide the first empirical results for KB completion on ATOMIC and evaluation with ranking metrics on ConceptNet. Our results demonstrate the effectiveness of language model representations in boosting link prediction performance and the advantages of learning from local graph structure (+1.5 points in MRR for ConceptNet) when training on subgraphs for computational efficiency. Further analysis on model predictions shines light on the types of commonsense knowledge that language models capture well.

PaperPDFCodeCode Syntology ran

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="1910.02915")

Code

Syntology Ran 1 of 12 code samples harvested from 1 repository linked to this paper; 11 have no recorded run. Of those that ran: 1 ran · honoured contract.

By repository: community (archive-listed): 12 samples from 1 repository, 1 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

allenai/commonsense-kg-completion mentioned on GitHubpytorchMIT report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

12 samples harvested; 1 ran; 1 honoured the contract we drafted; 11 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

1ran · honoured contract
11unverified

Licence: 0 of the 12 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from allenai/commonsense-kg-completion. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: 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. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

accuracy allenai/commonsense-kg-completion/lm_finetuning/simple_lm_finetuning.py community (archive-listed) ran · honoured contract fingerprinted MIT (permissive) · eb725d5794b15f6b · report
camel_case_split allenai/commonsense-kg-completion/src/bert_feature_extractor.py community (archive-listed) unverified MIT (permissive) · 420406b2e12799ee · report
convert_edges_to_examples allenai/commonsense-kg-completion/src/bert_feature_extractor.py community (archive-listed) unverified MIT (permissive) · f6b73f652e22a0f7 · report
convert_example_to_features allenai/commonsense-kg-completion/lm_finetuning/simple_lm_finetuning.py community (archive-listed) unverified MIT (permissive) · e44321eb9fe5de7a · report
convert_examples_to_features allenai/commonsense-kg-completion/src/bert_feature_extractor.py community (archive-listed) unverified MIT (permissive) · 8670d7299e3756ce · report
create_vocab allenai/commonsense-kg-completion/src/reader_utils.py community (archive-listed) unverified MIT (permissive) · 4916801754517961 · report
create_word_vocab allenai/commonsense-kg-completion/src/reader_utils.py community (archive-listed) unverified MIT (permissive) · 6c5d6cb16e3275c2 · report
get_filtered_ranks allenai/commonsense-kg-completion/src/evaluation_utils.py community (archive-listed) unverified MIT (permissive) · 973da3b6d17a8a2a · report
get_vocab_idx allenai/commonsense-kg-completion/src/reader_utils.py community (archive-listed) unverified MIT (permissive) · 5a26e3880ee60f5b · report
perturb_and_get_rank allenai/commonsense-kg-completion/src/evaluation_utils.py community (archive-listed) unverified MIT (permissive) · fc6caabfdb1a495d · report
random_word allenai/commonsense-kg-completion/lm_finetuning/simple_lm_finetuning.py community (archive-listed) unverified MIT (permissive) · c247b25173d2c822 · report
sort_and_rank allenai/commonsense-kg-completion/src/evaluation_utils.py community (archive-listed) unverified MIT (permissive) · 8353984688641dab · report

Tasks

Computational EfficiencyKnowledge Base CompletionKnowledge GraphsLanguage ModellingLink PredictionTransfer Learning

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Methods

Graph Convolutional Networks

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections