Pith. sign in

REVIEW 5 cited by

Crawling the Internal Knowledge-Base of 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 2301.12810 v1 pith:OGBOBIWW submitted 2023-01-30 cs.CL cs.AI

Crawling the Internal Knowledge-Base of Language Models

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

Language models are trained on large volumes of text, and as a result their parameters might contain a significant body of factual knowledge. Any downstream task performed by these models implicitly builds on these facts, and thus it is highly desirable to have means for representing this body of knowledge in an interpretable way. However, there is currently no mechanism for such a representation. Here, we propose to address this goal by extracting a knowledge-graph of facts from a given language model. We describe a procedure for ``crawling'' the internal knowledge-base of a language model. Specifically, given a seed entity, we expand a knowledge-graph around it. The crawling procedure is decomposed into sub-tasks, realized through specially designed prompts that control for both precision (i.e., that no wrong facts are generated) and recall (i.e., the number of facts generated). We evaluate our approach on graphs crawled starting from dozens of seed entities, and show it yields high precision graphs (82-92%), while emitting a reasonable number of facts per entity.

discussion (0)

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

Forward citations

Cited by 5 Pith papers

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

  1. Factual Retrieval in LLMs Is a Redundant, Distributed and Non-Contiguous Process

    cs.CL 2026-06 unverdicted novelty 6.0

    Attribute retrieval in LLMs follows non-contiguous, redundant layer paths identified via iterative patching, implying highly distributed knowledge storage.

  2. EHRAG: Bridging Semantic Gaps in Lightweight GraphRAG via Hybrid Hypergraph Construction and Retrieval

    cs.AI 2026-04 unverdicted novelty 6.0

    EHRAG constructs structural hyperedges from sentence co-occurrence and semantic hyperedges from entity embedding clusters, then applies hybrid diffusion plus topic-aware PPR to retrieve top-k documents, outperforming ...

  3. Understanding New-Knowledge-Induced Factual Hallucinations in LLMs: Analysis and Interpretation

    cs.CL 2025-11 unverdicted novelty 6.0

    Fine-tuning on new knowledge induces propagating hallucinations in LLMs by weakening attention to key entities, with mitigation via reintroducing known knowledge during later training stages.

  4. Improving Factuality in LLMs via Inference-Time Knowledge Graph Construction

    cs.CL 2025-08 unverdicted novelty 5.0

    A framework for inference-time knowledge graph construction and expansion improves factual accuracy in LLMs on three QA benchmarks by combining internal LLM knowledge with selective external retrieval.

  5. Construction of Knowledge Graph based on Language Model

    cs.CL 2026-04 unverdicted novelty 3.0

    The paper surveys PLM-based knowledge graph construction and proposes the LLHKG framework claiming that lightweight LLMs achieve KG construction performance comparable to GPT-3.5.