# Relational Word Embeddings

## TL;DR

This paper introduces a method to encode relational knowledge in a separate word embedding learned from co-occurrence data, complementing standard embeddings without relying on external knowledge bases.

## Contribution

It proposes a novel approach to encode relational information separately, addressing limitations of previous methods that depend on external knowledge bases.

## Key findings

- Relational embeddings capture complementary information to standard embeddings.
- The approach works without external knowledge bases.
- Relational vectors encode specific relational information.

## Abstract

While word embeddings have been shown to implicitly encode various forms of attributional knowledge, the extent to which they capture relational information is far more limited. In previous work, this limitation has been addressed by incorporating relational knowledge from external knowledge bases when learning the word embedding. Such strategies may not be optimal, however, as they are limited by the coverage of available resources and conflate similarity with other forms of relatedness. As an alternative, in this paper we propose to encode relational knowledge in a separate word embedding, which is aimed to be complementary to a given standard word embedding. This relational word embedding is still learned from co-occurrence statistics, and can thus be used even when no external knowledge base is available. Our analysis shows that relational word vectors do indeed capture information that is complementary to what is encoded in standard word embeddings.