Pith. sign in

REVIEW 1 cited by

Construction of Hyper-Relational Knowledge Graphs Using Pre-Trained 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 2403.11786 v1 pith:MKWBXGNR submitted 2024-03-18 cs.CL cs.AI

classification cs.CLcs.AI
keywords knowledgemodelextractinggraphshyper-relationalachievedaddressalthough
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Extracting hyper-relations is crucial for constructing comprehensive knowledge graphs, but there are limited supervised methods available for this task. To address this gap, we introduce a zero-shot prompt-based method using OpenAI's GPT-3.5 model for extracting hyper-relational knowledge from text. Comparing our model with a baseline, we achieved promising results, with a recall of 0.77. Although our precision is currently lower, a detailed analysis of the model outputs has uncovered potential pathways for future research in this area.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

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

  1. Large Language Models for Knowledge Graph Embedding: A Survey

    cs.CL 2025-01 reject novelty 3.0 of 10

    A survey that classifies LLM-based knowledge graph embedding methods by knowledge graph scenario and degree of LLM invocation, but with no new experimental results.

Pith tools