Challenge: Pre-trained language models capture factual knowledge from massive texts . but they are still quite behind the SOTA KGC models in terms of performance .
Approach: They propose to use open-world assumption to evaluate PLM-based knowledge graph completion models . they propose to convert each triple and its support information into natural prompt sentences .
Outcome: The proposed model is more accurate under the open-world assumption (OWA) this setting manual checks the correctness of knowledge that is not in KGs.

Similar Papers

Path-enhanced Pre-trained Language Model for Knowledge Graph Completion (2025.findings-emnlp)

Copied to clipboard

Challenge: Pre-trained language models have achieved remarkable knowledge graph completion (KGC) success.
Approach: They propose a path-enhanced pre-trained language model-based knowledge graph completion method which uses multi-view generation to infer missing facts in triple-level and path-level simultaneously.
Outcome: The proposed method significantly improves the performance of the knowledge graph completion task.
Knowledge Context Modeling with Pre-trained Language Models for Contrastive Knowledge Graph Completion (2024.findings-acl)

Copied to clipboard

Challenge: Text-based knowledge graph completion methods neglect knowledge contexts in inferring process.
Approach: They propose a framework which models the knowledge context as additional prompts with pre-trained language models for knowledge graph completion.
Outcome: The proposed framework achieves state-of-the-art on FB15k-237, WN18RR and Wikidata5M datasets.
Does Pre-trained Language Model Actually Infer Unseen Links in Knowledge Graph Completion? (2024.naacl-long)

Copied to clipboard

Challenge: Knowledge Graph Completion (KGC) is a task that infers unseen relationships between entities . traditional embedding-based methods infer missing links using only training data . a pre-trained language model (PLM)-based KGC may be ineffective in practical applications .
Approach: They propose to use knowledge Graph Completion (KGC) to infer unseen relationships . traditional embedding-based KGC methods infer missing links only from training data . they argue that pre-trained language models acquire inference abilities through pre-training .
Outcome: The proposed method improves performance even though it does not use memorized knowledge.
Dipping PLMs Sauce: Bridging Structure and Text for Effective Knowledge Graph Completion via Conditional Soft Prompting (2023.findings-acl)

Copied to clipboard

Challenge: Knowledge Graph Completion (KGC) often requires both KG structural and textual information to be effective.
Approach: They propose a system which tunes the parameters of Conditional Soft Prompts generated by entities and relations representations to maintain a balance between textual and structural knowledge.
Outcome: The proposed components outperform baseline models on three static and temporal benchmarks.
Text Augmented Open Knowledge Graph Completion via Pre-Trained Language Models (2023.findings-acl)

Copied to clipboard

Challenge: Existing methods to augment knowledge graph completion require factual triples or manual prompts to extract knowledge from a pre-trained language model.
Approach: They propose a tool that generates quality query prompts and retrieves support information from large text corpora to probe knowledge from a pre-trained language model.
Outcome: The proposed method outperforms embedding-based, graph-based and PLM-based methods on two benchmark datasets.
MusKGC: A Flexible Multi-source Knowledge Enhancement Framework for Open-World Knowledge Graph Completion (2025.emnlp-main)

Copied to clipboard

Challenge: Open-world knowledge graph completion (KGC) aims to infer novel facts by enriching existing graphs with external knowledge sources while maintaining semantic consistency under the open-world assumption (OWA).
Approach: They propose a multi-source knowledge enhancement framework based on an open-world assumption (OWA) that integrates external knowledge sources and a new evaluation strategy to validate new facts.
Outcome: The proposed model achieves SOTA performance across benchmarks and the evaluation strategy effectively assesses new facts under OWA.
A Re-evaluation of Knowledge Graph Completion Methods (2020.acl-main)

Copied to clipboard

Challenge: Knowledge Graph Completion (KGC) aims at automatically predicting missing links for large-scale knowledge graphs.
Approach: They propose a protocol to evaluate KGC methods that is robust to handle bias in the model, which can substantially affect the final results.
Outcome: The proposed evaluation protocol is robust to handle bias in the model, which can substantially affect the final results.
SimKGC: Simple Contrastive Knowledge Graph Completion with Pre-trained Language Models (2022.acl-long)

Copied to clipboard

Challenge: Text-based methods lag behind graph embedding-based approaches for knowledge graph completion (KGC)
Approach: They propose three types of negatives to improve contrastive learning to improve learning efficiency.
Outcome: The proposed model outperforms embedding-based methods on several benchmark datasets.
Multi-perspective Improvement of Knowledge Graph Completion with Large Language Models (2024.lrec-main)

Copied to clipboard

Challenge: Knowledge graph completion (KGC) is a widely used method to tackle incompleteness in knowledge graphs (KGs).
Approach: They propose a general framework to compensate for the deficiency of contextualized knowledge by querying large language models from various perspectives.
Outcome: The proposed framework improves knowledge graph completion (KGC) by querying large language models from various perspectives.
KICGPT: Large Language Model with Knowledge in Context for Knowledge Graph Completion (2023.findings-emnlp)

Copied to clipboard

Challenge: Existing knowledge graph completion methods struggle with long-tail entities due to limited structural information and imbalanced distributions of entities.
Approach: They propose a framework that integrates a large language model and a triple-based KGC retriever to alleviate the long-tail problem without incurring additional training overhead.
Outcome: The proposed model reduces training overhead and finetuning costs on benchmark datasets.

What is GenGO?

GenGO is an NLP powered publication search system. It currenctly indexes 30k+ papers from ACL Anthology, and implements multi-aspect summarization, semantic search, and more!

Information

About
Limitations