Low Dimensional Embeddings
Related Papers
Connecting Language and Knowledge Bases with Embedding Models for Relation Extraction
This paper proposes a novel approach for rela- tion extraction from free text which is trained to jointly use information from the text and from existing knowledge. Our model is …...
Learning Task-specific Bilexical Embeddings
We present a method that learns bilexical operators over distributional representations of words and leverages supervised data for a linguistic relation. The learning algorithm exploits low- rank bilinear forms and …...
Low-dimensional Embeddings for Interpretable Anchor-based Topic Inference
The anchor words algorithm performs provably efficient topic model inference by finding an approximate convex hull in a high-dimensional word co-occurrence space. However, the existing greedy al- gorithm often selects …...
Injecting Logical Background Knowledge into Embeddings for Relation Extraction
Matrix factorization approaches to relation extraction provide several attractive features: they support distant supervision, handle open schemas, and leverage unlabeled data. Unfortu- nately, these methods share a shortcoming with all …...
Learning Better Embeddings for Rare Words Using Distributional Representations
There are two main types of word repre- sentations: low-dimensional embeddings and high-dimensional distributional vec- tors, in which each dimension corresponds to a context word. In this paper, we ini- …...
What’s in an Embedding? Analyzing Word Embeddings through Multilingual Evaluation
In the last two years, there has been a surge of word embedding algorithms and research on them. However, evaluation has mostly been carried out on a narrow set of …...
Learning and Evaluating Character Representations in Novels
AbstractWe address the problem of learning fixed-length vector representations of characters in novels. Recent advances in word embeddings have proven successful in learning entity representations from short texts, but fall …...