Challenge: Existing approaches to construct knowledge graphs struggle with factual coverage and information loss.
Approach: They propose an automated KG construction method that introduces question-answer pairs as a structured intermediate representation to unfold document-level semantics prior to triple extraction.
Outcome: The proposed method achieves superior factual retention while maintaining high structural cohesion even as extracted knowledge volume substantially expands.

Similar Papers

Tree-KG: An Expandable Knowledge Graph Construction Framework for Knowledge-intensive Domains (2025.acl-long)

Copied to clipboard

Challenge: Knowledge graphs are a useful tool for organizing complex data in knowledge-intensive domains.
Approach: They propose an expandable framework that combines structured domain texts with advanced semantic techniques to create a tree-like graph from textbooks.
Outcome: The proposed framework surpasses competing methods in the text-Annotated dataset with high scores on the Text-Annalytated data.
Automated Knowledge Graph Construction using Large Language Models and Sentence Complexity Modelling (2025.emnlp-main)

Copied to clipboard

Challenge: integrating coreference and decomposition increases recall on rare relations by over 20%.
Approach: They propose an open-source pipeline for extracting sentence-level knowledge graphs by combining robust coreference resolution with syntactic sentence decomposition.
Outcome: The proposed pipeline achieves a 99.8% exact-match accuracy on sentence simplification.
Can LLMs be Good Graph Judge for Knowledge Graph Construction? (2025.emnlp-main)

Copied to clipboard

Challenge: Existing methods for converting unstructured text into structured Knowledge Graphs (KGs) have limitations such as large amount of noise, inaccurate knowledge, and hallucination .
Approach: They propose a GraphJudge framework to reduce noise in real-world documents . they propose Graphjudge to fine-tune a LLM as a graph judge to enhance quality .
Outcome: The proposed framework eliminates noise in real-world documents and improves the quality of generated KGs.
CogMG: Collaborative Augmentation Between Large Language Model and Knowledge Graph (2024.acl-demos)

Copied to clipboard

Challenge: Large language models (LLMs) are susceptible to generating hallucinated content and often encompass factually inaccurate information.
Approach: They propose a framework that leverages knowledge graphs to address the limitations of Large Language Models (LLMs) they identify and decompose required knowledge triples that are not present in the KG, enriching them and aligning updates with real-world demands.
Outcome: The proposed framework reduces hallucinations and increases factual accuracy in QA scenarios while retaining the same quality of knowledge.
Knowledge Is Flat: A Seq2Seq Generative Framework for Various Knowledge Graph Completion (2022.coling-1)

Copied to clipboard

Challenge: Knowledge Graph Completion (KGC) has been extended to multiple knowledge graph (KG) structures, initiating new research directions, e.g. static KGC, temporal KGC and few-shot KGC.
Approach: They propose a generative framework that could tackle different verbalizable graph structures by unifying the representation of KG facts into "flat" text.
Outcome: The proposed framework outperforms many competitive baselines and sets new state-of-the-art performance on five benchmarks.
KG-CQR: Leveraging Structured Relation Representations in Knowledge Graphs for Contextual Query Retrieval (2025.emnlp-main)

Copied to clipboard

Challenge: Existing methods that address corpus-level context loss focus on query enrichment through structured relation representations.
Approach: They propose a framework for Contextual Query Retrieval that enriches queries with contextual representations derived from a corpus-centric KG.
Outcome: The proposed framework outperforms strong baselines on RAGBench and MultiHop-RAG datasets in terms of retrieval effectiveness.
HOLMES: Hyper-Relational Knowledge Graphs for Multi-hop Question Answering using LLMs (2024.acl-long)

Copied to clipboard

Challenge: Existing approaches to answer multi-hop questions are query-agnostic and the extracted facts are ambiguous as they lack context.
Approach: They propose to use a knowledge graph to extract query-relevant information from unstructured text.
Outcome: The proposed method achieves performance improvements on two popular datasets.
KG-MuLQA: A Framework for KG-based Multi-Level QA Extraction and Long-Context LLM Evaluation (2026.acl-long)

Copied to clipboard

Challenge: KG-MulQA extracts QA pairs at multiple complexity levels along three key dimensions: multi-hop retrieval, set operations, and answer plurality.
Approach: They propose a framework that extracts QA pairs at multiple complexity levels along three key dimensions: multi-hop retrieval, set operations, and answer plurality.
Outcome: The framework extracts QA pairs at multiple complexity levels along key dimensions . it enables fine-grained assessment of model performance across controlled difficulty levels.
LLMs as Knowledge Graph Refiners: Mitigating Factual Inconsistencies in Generative Knowledge Extraction (2026.acl-long)

Copied to clipboard

Challenge: Knowledge graphs (KGs) represent real-world entities and their relations in a structured form.
Approach: They propose a framework that performs triple-level refinement on KGs constructed via GKE.
Outcome: The proposed framework improves KG quality from diverse perspectives.
CORN: Co-Reasoning Network for Commonsense Question Answering (2022.coling-1)

Copied to clipboard

Challenge: Existing work uses two independent modules to model QA content and external commonsense knowledge graph (KG) Existing research uses two separate modules to create QA contextual text representations and relationships between QA entities.
Approach: They propose a commonsense question answering (QA) model that uses two independent modules to model QA contextual text representation and relationships between QA entities in KG.
Outcome: The proposed model achieves state-of-the-art on QA benchmarks in the CommonsenseQA and OpenBookQA 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