| 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. |
Similar Papers
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. |
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. |
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. |
OpenKI: Integrating Open Information Extraction and Knowledge Bases with Relation Inference (N19-1)
Copied to clipboard
| Challenge: | Existing methods for knowledge extraction and alignment are limited in quality and performance. |
| Approach: | They propose to integrate OpenIE extractions in the form of (subject, predicate, object) triples with Knowledge Bases (KB) |
| Outcome: | The proposed method improves state-of-the-art for OpenIE extractions and boosts performance on OpenIE from semi-structured data. |
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. |
Open Knowledge Graphs Canonicalization using Variational Autoencoders (2021.emnlp-main)
Copied to clipboard
| Challenge: | Existing approaches to solve this problem generate embeddings for noun and relation phrases . ambiguous subject-relation-object triples are created by open knowledge graphs . |
| Approach: | They propose a model to learn both embeddings and cluster assignments in an end-to-end approach . they propose CUVA to be able to group noun and relation phrases using embeddable features . |
| Outcome: | The proposed model outperforms state-of-the-art methods over multiple benchmarks. |
Enhancing Contextual Word Representations Using Embedding of Neighboring Entities in Knowledge Graphs (2022.coling-1)
Copied to clipboard
| Challenge: | Existing methods for pre-trained language models lack explicit grounding in real-world entities. |
| Approach: | They propose a mechanism that integrates the structure of a KG into recent PLM architectures by generalizing the embeddings of neighboring entities. |
| Outcome: | The proposed method improves a classification task, entity typing task and language comprehension tasks. |
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. |
VISTA: Visual-Textual Knowledge Graph Representation Learning (2023.findings-emnlp)
Copied to clipboard
| Challenge: | Existing knowledge graph embedding methods only consider the structure of a knowledge graph, but some recent proposed methods utilize images or text descriptions of entities in a VTKG. |
| Approach: | They propose a visual-textual knowledge graph (VTKG) where triplets can be explained using images and entities and relations can accompany text descriptions. |
| Outcome: | The proposed method outperforms state-of-the-art knowledge graph completion methods in real-world knowledge graphs. |
Improving Knowledge Graph Embedding Using Simple Constraints (P18-1)
Copied to clipboard
| Challenge: | Recent efforts focused on designing more complicated models or incorporating extra information beyond triples. |
| Approach: | They propose to use non-negativity constraints on entity representations and approximate entailment constraints on relation representations to improve KG embedding. |
| Outcome: | The proposed model outperforms baseline models on WordNet, Freebase, and DBpedia. |