Pith. sign in

REVIEW 1 cited by

Joint Language Semantic and Structure Embedding for Knowledge Graph Completion

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 2209.08721 v1 pith:TVGRRIEW submitted 2022-09-19 cs.CL cs.AIcs.LG

classification cs.CLcs.AIcs.LG
keywords knowledgelanguagesemanticscompletiongraphmethodgraphsinformation
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

The task of completing knowledge triplets has broad downstream applications. Both structural and semantic information plays an important role in knowledge graph completion. Unlike previous approaches that rely on either the structures or semantics of the knowledge graphs, we propose to jointly embed the semantics in the natural language description of the knowledge triplets with their structure information. Our method embeds knowledge graphs for the completion task via fine-tuning pre-trained language models with respect to a probabilistic structured loss, where the forward pass of the language models captures semantics and the loss reconstructs structures. Our extensive experiments on a variety of knowledge graph benchmarks have demonstrated the state-of-the-art performance of our method. We also show that our method can significantly improve the performance in a low-resource regime, thanks to the better use of semantics. The code and datasets are available at https://github.com/pkusjh/LASS.

Discussion (0). Sign in 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. Flow-Modulated Scoring for Semantic-Aware Knowledge Graph Completion

    cs.CL 2025-06 reject novelty 5.0 of 10

    A relation-prediction model that combines top-K edge message passing with a conditional flow matching auxiliary loss, reporting near-perfect relation prediction and a 25% relative MRR gain in entity prediction.

Pith tools