Challenge: Knowledge Graph Completion (KGC) attempts to learn missing links from subsets.
Approach: This survey/position paper discusses ways to improve coverage of resources such as WordNet.
Outcome: The proposed method improves WordNet coverage by reducing the number of words in the sample and reducing unbalanced corpora.

Similar Papers

Better Together: Enhancing Generative Knowledge Graph Completion with Language Models and Neighborhood Information (2023.findings-emnlp)

Copied to clipboard

Challenge: Knowledge graph completion (KGC) methods are computationally intensive and impractical for large-scale KGs.
Approach: They propose to include node neighborhoods as additional information to improve KGC methods based on language models.
Outcome: The proposed method outperforms KGT5 and conventional methods on inductive and transductive Wikidata subsets and shows its importance.
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.
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.
A Survey on Automatically-Constructed WordNets and their Evaluation: Lexical and Word Embedding-based Approaches (L18-1)

Copied to clipboard

Challenge: WordNets are lexical databases in which groups of synonyms are stored according to the semantic relationships between them.
Approach: This paper describes various approaches to constructing WordNets automatically by leveraging traditional lexical resources and newer trends such as word embeddings.
Outcome: The proposed methods leverage traditional lexical resources and newer trends such as word embeddings to build and evaluate WordNets.
End-to-End Construction of NLP Knowledge Graph (2021.findings-acl)

Copied to clipboard

Challenge: a new schema for NLP knowledge about tasks, datasets and metrics is proposed.
Approach: They propose a new schema that represents knowledge about tasks, datasets and metrics in the NLP domain.
Outcome: The proposed framework can be automatically built into scientific leaderboards . the proposed system achieves reasonable results for all relation types on this small-scale graph .
Increasing Coverage and Precision of Textual Information in Multilingual Knowledge Graphs (2023.emnlp-main)

Copied to clipboard

Challenge: Existing methods to generate knowledge graphs are unable to handle non-English textual information.
Approach: They propose a task of automatic Knowledge Graph Completion to bridge the gap between English and non-English textual information.
Outcome: The proposed method bridges the gap between the quantity and quality of textual information between English and non-English languages.
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.
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.
A Framework for Adapting Pre-Trained Language Models to Knowledge Graph Completion (2022.emnlp-main)

Copied to clipboard

Challenge: Recent work has demonstrated that entity representations can be extracted from pre-trained language models to develop knowledge graph completion models that are more robust to the naturally occurring sparsity found in knowledge graphs.
Approach: They propose unsupervised and supervised methods to extract more informative representations from pre-trained language models to develop knowledge graph completion models.
Outcome: The proposed model outperforms recent neural models in terms of performance and unsupervised processing methods.
Efficient and Robust Knowledge Graph Construction (2022.aacl-tutorials)

Copied to clipboard

Challenge: Knowledge graph construction has appealed to the NLP community but has encountered similar issues such as efficiency and robustness.
Approach: They propose to introduce efficient and robust knowledge graph construction techniques and discuss their results.
Outcome: This tutorial will provide an overview of the latest and ongoing techniques for efficient and robust knowledge graph construction.

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