Pith. sign in

REVIEW 2 cited by

iText2KG: Incremental Knowledge Graphs Construction Using Large Language Models

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2409.03284 v1 pith:GWVR34FO submitted 2024-09-05 cs.AI cs.CLcs.IR

iText2KG: Incremental Knowledge Graphs Construction Using Large Language Models

classification cs.AI cs.CLcs.IR
keywords graphsincrementalconstructionentityinformationmethodacrossdata
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

Most available data is unstructured, making it challenging to access valuable information. Automatically building Knowledge Graphs (KGs) is crucial for structuring data and making it accessible, allowing users to search for information effectively. KGs also facilitate insights, inference, and reasoning. Traditional NLP methods, such as named entity recognition and relation extraction, are key in information retrieval but face limitations, including the use of predefined entity types and the need for supervised learning. Current research leverages large language models' capabilities, such as zero- or few-shot learning. However, unresolved and semantically duplicated entities and relations still pose challenges, leading to inconsistent graphs and requiring extensive post-processing. Additionally, most approaches are topic-dependent. In this paper, we propose iText2KG, a method for incremental, topic-independent KG construction without post-processing. This plug-and-play, zero-shot method is applicable across a wide range of KG construction scenarios and comprises four modules: Document Distiller, Incremental Entity Extractor, Incremental Relation Extractor, and Graph Integrator and Visualization. Our method demonstrates superior performance compared to baseline methods across three scenarios: converting scientific papers to graphs, websites to graphs, and CVs to graphs.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. FAIR GraphRAG: A Retrieval-Augmented Generation Approach for Semantic Data Analysis

    cs.IR 2026-07 conditional novelty 6.0

    Embedding FAIR Digital Objects as graph nodes yields a GraphRAG system that measurably improves accuracy, coverage and explainability on biomedical RNA-seq queries versus a non-FAIR baseline.

  2. LLM-Assisted Ontology Engineering and Construction of a French Legal Knowledge Graph

    cs.AI 2026-07 conditional novelty 5.0

    An LLM-assisted open-then-closed extraction pipeline induces maintenance object properties from SEMLEG and builds fused RDF legal KGs with high class alignment but only moderate signature compliance.