OKGIT: Open Knowledge Graph Link Prediction with Implicit Types (2021.findings-acl)
Copied to clipboard
| Challenge: | Open Knowledge Graphs (OpenKGs) are sparse and not directly usable in an end task. |
| Approach: | They propose a method that bootstraps OpenKGs from a corpus using OpenIE tools. |
| Outcome: | The proposed method achieves state-of-the-art performance while producing type compatible NPs in the link prediction task. |
Similar Papers
CaRe: Open Knowledge Graph Embeddings (D19-1)
Copied to clipboard
| Challenge: | Existing methods for generating Open Knowledge Graphs have been criticized for not achieving canonicalization of OpenKGs. |
| Approach: | They propose to use Open Information Extraction methods to extract triples from text . they propose to learn embeddings of NPs and RPs present in the graph . |
| Outcome: | The proposed methods improve OpenKG embeddings and bootstrap OpenKGs from text corpus. |
Can We Predict New Facts with Open Knowledge Graph Embeddings? A Benchmark for Open Link Prediction (2020.acl-main)
Copied to clipboard
| Challenge: | Existing methods for predicting knowledge graphs rely on the rich structure of the knowledge graph. |
| Approach: | They propose an evaluation protocol and a methodology for creating the open link prediction benchmark OlpBench. |
| Outcome: | The proposed model predicts test facts by completing questions in open link prediction task. |
Open-Domain Contextual Link Prediction and its Complementarity with Entailment Graphs (2021.findings-emnlp)
Copied to clipboard
| Challenge: | Existing methods for linking knowledge graphs only use textual contexts . contextual link prediction is useful for finding context-dependent entailments . |
| Approach: | They propose a task of open-domain contextual link prediction which uses textual context and KG structure to perform link prediction. |
| Outcome: | The proposed model can ground the triples in the context of the original dataset and infer missing relations in context. |
A Survey of Link Prediction in N-ary Knowledge Graphs (2025.emnlp-main)
Copied to clipboard
Jiyao Wei, Saiping Guan, Da Li, Zhongni Hou, Miao Su, Yucan Guo, Xiaolong Jin, Jiafeng Guo, Xueqi Cheng
| Challenge: | N-ary Knowledge Graphs (NKGs) capture n-ary facts containing more than two entities. |
| Approach: | They present the first comprehensive survey of link prediction in NKGs . they provide an overview of the field and analyze their performance and application scenarios . |
| Outcome: | The proposed methods provide an overview of the field and analyze performance and application scenarios. |
How Sememic Components Can Benefit Link Prediction for Lexico-Semantic Knowledge Graphs? (2025.emnlp-main)
Copied to clipboard
| Challenge: | Existing methods to predict missing triples in Knowledge Graphs are limited by semantic information. |
| Approach: | They propose a method to leverage sememe knowledge to enhance LP . LP is a technique that integrates structural and textual information into a Knowledge Graph . |
| Outcome: | The proposed method improves LP performance in English and Chinese . it improves on WN18RR, HN7 and CWN5, respectively . |
IEKG: A Commonsense Knowledge Graph for Idiomatic Expressions (2023.emnlp-main)
Copied to clipboard
| Challenge: | Prior work on IE comprehension has focused on detecting idiomaticity, but this fails to account for IEs' non-compositionality. |
| Approach: | They construct a commonsense knowledge graph for figurative interpretations of IEs that can be used to convert PTLMs into knowledge models that encode and infer commonsensical knowledge related to IE use. |
| Outcome: | The proposed model can generalize to IEs unseen during training. |
Linking Surface Facts to Large-Scale Knowledge Graphs (2023.emnlp-main)
Copied to clipboard
| Challenge: | Open Information Extraction (OIE) methods extract facts in the form of triples . ambiguity of these triples hinders their downstream usage . |
| Approach: | They propose a benchmark that measures fact linking performance on a granular triple slot level . they propose to use a system that can detect out-of-KG entities and predicates . |
| Outcome: | The proposed benchmark can measure fact linking performance on a granular triple slot level while also measuring if a system can recognize that a surface form has no match in the existing KG. |
Integrating Lexical Information into Entity Neighbourhood Representations for Relation Prediction (2021.naacl-main)
Copied to clipboard
| Challenge: | Existing methods to predict knowledge base relations are limited by maintenance costs and text-based formats. |
| Approach: | They propose a system that can extend relational database tables with information extracted from a document corpus. |
| Outcome: | The proposed system outperforms existing methods by incorporating embeddings of text-based representations of the entities and relations. |
A Benchmark for Semi-Inductive Link Prediction in Knowledge Graphs (2023.findings-emnlp)
Copied to clipboard
| Challenge: | Semi-inductive link prediction (LP) is a task of predicting facts for new, previously unseen entities based on context information. |
| Approach: | They propose to use Wikidata5M to evaluate semi-inductive link prediction (LP) in knowledge graphs. |
| Outcome: | The proposed benchmark provides a test bed for further research into semi-inductive link prediction (LP) in knowledge graphs. |
COMBO: A Complete Benchmark for Open KG Canonicalization (2023.eacl-main)
Copied to clipboard
| Challenge: | Existing datasets for open KG canonicalization only provide gold entity-level canonization for noun phrases. |
| Approach: | They propose a complete benchmark for open KG canonicalization that provides gold ontology-level canonization for relation phrases and source sentences for extraction. |
| Outcome: | The proposed method improves relation canonicalization and ontology-level canonization of the noun phrase. |