Pith. sign in

REVIEW 9 cited by

Extract, Define, Canonicalize: An LLM-based Framework for Knowledge Graph Construction

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

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 2404.03868 v2 pith:JRVXXQGC submitted 2024-04-05 cs.CL cs.AIcs.LG

Bowen Zhang , Harold Soh This is my paper
classification cs.CLcs.AIcs.LG
keywords schemaavailablellmstextextractextractionframeworkgraph
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

In this work, we are interested in automated methods for knowledge graph creation (KGC) from input text. Progress on large language models (LLMs) has prompted a series of recent works applying them to KGC, e.g., via zero/few-shot prompting. Despite successes on small domain-specific datasets, these models face difficulties scaling up to text common in many real-world applications. A principal issue is that, in prior methods, the KG schema has to be included in the LLM prompt to generate valid triplets; larger and more complex schemas easily exceed the LLMs' context window length. Furthermore, there are scenarios where a fixed pre-defined schema is not available and we would like the method to construct a high-quality KG with a succinct self-generated schema. To address these problems, we propose a three-phase framework named Extract-Define-Canonicalize (EDC): open information extraction followed by schema definition and post-hoc canonicalization. EDC is flexible in that it can be applied to settings where a pre-defined target schema is available and when it is not; in the latter case, it constructs a schema automatically and applies self-canonicalization. To further improve performance, we introduce a trained component that retrieves schema elements relevant to the input text; this improves the LLMs' extraction performance in a retrieval-augmented generation-like manner. We demonstrate on three KGC benchmarks that EDC is able to extract high-quality triplets without any parameter tuning and with significantly larger schemas compared to prior works. Code for EDC is available at https://github.com/clear-nus/edc.

Discussion (0). Sign in to comment.

Forward citations

Cited by 9 Pith papers

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

  1. ClimateViz: A Benchmark for Statistical Reasoning and Fact Verification on Scientific Charts

    cs.CL 2025-06 conditional novelty 7.0 of 10

    A large-scale benchmark shows that leading multimodal language models still underperform expert humans at verifying climate claims from scientific charts.

  2. LA-RL: Label-Aware Self-Reflection for Reinforcement Learning in Information Extraction

    cs.CL 2026-07 conditional novelty 6.0 of 10

    Label-aware diagnostic reflection plus two-stage outcome GRPO improves same-backbone IE F1 over SFT, with larger gains under relation-extraction domain shift.

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

    cs.IR 2026-07 conditional novelty 6.0 of 10

    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.

  4. From "Strings" to "Things" for Personal Knowledge Graphs: Evaluating LLM Triple Extraction for Recommendation Systems

    cs.IR 2026-04 conditional novelty 6.0 of 10

    Open-weight LLMs extract usable user-preference triples from recommendation dialogues for Personal Knowledge Graphs, with balanced small models often best for downstream recommendations.

  5. KG-ViP: Bridging Knowledge Grounding and Visual Perception in Multi-modal LLMs for Visual Question Answering

    cs.CV 2026-01 unverdicted novelty 6.0 of 10

    KG-ViP fuses scene graphs and commonsense graphs via a query-based retrieval-and-fusion pipeline to improve multi-modal LLM performance on visual question answering.

  6. Hyper-KGGen: A Skill-Driven Knowledge Extractor for High-Quality Knowledge Hypergraph Generation

    cs.CL 2026-02 conditional novelty 5.0 of 10

    Hyper-KGGen improves n-ary knowledge hypergraph extraction by learning a reusable skill library from stable, unstable, and missed LLM predictions, and introduces the HyperDocRED benchmark.

  7. Open Scene Graphs for Open-World Object-Goal Navigation

    cs.RO 2025-08 unverdicted novelty 5.0 of 10

    OSG Navigator adds auto-generated scene-graph schemas as spatial memory to foundation models, reporting SOTA ObjectNav performance with zero-shot generalization across environments, goals, and robots.

  8. HyDRA: A Hybrid-Driven Reasoning Architecture for Verifiable Knowledge Graphs

    cs.LG 2025-07 conditional novelty 5.0 of 10

    HyDRA, a contract-driven LLM pipeline for building ontologies and knowledge graphs, scored 42-62% accuracy on MedExQA biomedical QA while an ontology-free baseline scored 95-98%.

  9. CORE-KG: An LLM-Driven Knowledge Graph Construction Framework for Human Smuggling Networks

    cs.CL 2025-06 conditional novelty 5.0 of 10

    CORE-KG reduces node duplication by 33.28% and legal noise by 38.37% versus a GraphRAG baseline on 20 human smuggling court cases, through type-aware LLM coreference resolution and domain-filtered extraction prompts.

Pith tools