Pith. sign in

REVIEW 3 cited by

K-BERT: Enabling Language Representation with Knowledge Graph

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 1909.07606 v1 pith:QZUMTZNZ submitted 2019-09-17 cs.CL cs.LG

classification cs.CLcs.LG
keywords knowledgek-bertlanguagerepresentationbertdomaindomain-specificexperts
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Pre-trained language representation models, such as BERT, capture a general language representation from large-scale corpora, but lack domain-specific knowledge. When reading a domain text, experts make inferences with relevant knowledge. For machines to achieve this capability, we propose a knowledge-enabled language representation model (K-BERT) with knowledge graphs (KGs), in which triples are injected into the sentences as domain knowledge. However, too much knowledge incorporation may divert the sentence from its correct meaning, which is called knowledge noise (KN) issue. To overcome KN, K-BERT introduces soft-position and visible matrix to limit the impact of knowledge. K-BERT can easily inject domain knowledge into the models by equipped with a KG without pre-training by-self because it is capable of loading model parameters from the pre-trained BERT. Our investigation reveals promising results in twelve NLP tasks. Especially in domain-specific tasks (including finance, law, and medicine), K-BERT significantly outperforms BERT, which demonstrates that K-BERT is an excellent choice for solving the knowledge-driven problems that require experts.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 3 Pith papers

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

  1. Specializing Unsupervised Pretraining Models for Word-Level Semantic Similarity

    cs.CL 2019-09 conditional novelty 7.0 of 10

    LIBERT, a BERT variant pretrained with an auxiliary word-pair similarity task, outperforms BERT on 9/10 GLUE tasks and on three lexical simplification datasets.

  2. KoRe: Compact Knowledge Representations for Large Language Models

    cs.CL 2026-05 unverdicted novelty 6.0 of 10

    KoRe encodes 1-hop knowledge graph subgraphs as compact discrete tokens for injection into LLMs, achieving competitive benchmark performance with up to 10x token reduction.

  3. CPRM: A LLM-based Continual Pre-training Framework for Relevance Modeling in Commercial Search

    cs.AI 2024-12 conditional novelty 5.0 of 10

    A continual pre-training framework combining query-item joint training, in-context pre-training on related queries/items, and teacher-generated reading comprehension data improves LLM relevance modeling in commercial search.

Pith tools