about
Latent Relation Language Models (arxiv.org)
2 points by sel1 on Aug 22, 2019 | hide | past | pdf | discuss on HN

In plain words: This language model predicts words and the entities in a text together, using relationships from a knowledge graph to guide both. It beat a plain word-based model and an earlier knowledge-graph-based one, and can label entity spans with the relations they imply.

Abstract

In this paper, we propose Latent Relation Language Models (LRLMs), a class of language models that parameterizes the joint distribution over the words in a document and the entities that occur therein via knowledge graph relations. This model has a number of attractive properties: it not only improves language modeling performance, but is also able to annotate the posterior probability of entity spans for a given text through relations. Experiments demonstrate empirical improvements over both a word-based baseline language model and a previous approach that incorporates knowledge graph information. Qualitative analysis further demonstrates the proposed model's ability to learn to predict appropriate relations in context.

Hiroaki Hayashi, Zecong Hu, Chenyan Xiong, Graham Neubig
arXiv:1908.07690 · cs.CL · submitted Aug 21, 2019
abstract · pdf · html

add comment on HN