Pith. sign in

REVIEW

Retrieving Multi-Entity Associations: An Evaluation of Combination Modes for Word Embeddings

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 1905.09052 v1 pith:M3JWSZAA submitted 2019-05-22 cs.IR cs.CL

classification cs.IRcs.CL
keywords wordembeddingscombinationembeddingmethodsmodesrelationsrepresentations
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Word embeddings have gained significant attention as learnable representations of semantic relations between words, and have been shown to improve upon the results of traditional word representations. However, little effort has been devoted to using embeddings for the retrieval of entity associations beyond pairwise relations. In this paper, we use popular embedding methods to train vector representations of an entity-annotated news corpus, and evaluate their performance for the task of predicting entity participation in news events versus a traditional word cooccurrence network as a baseline. To support queries for events with multiple participating entities, we test a number of combination modes for the embedding vectors. While we find that even the best combination modes for word embeddings do not quite reach the performance of the full cooccurrence network, especially for rare entities, we observe that different embedding methods model different types of relations, thereby indicating the potential for ensemble methods.

Discussion (0). Continue with ORCID to comment.

Pith tools