Using graphs for word embedding with enhanced semantic relations

8Citations
Citations of this article
76Readers
Mendeley users who have this article in their library.

Abstract

Word embedding algorithms have become a common tool in the field of natural language processing. While some, like Word2Vec, are based on sequential text input, others are utilizing a graph representation of text. In this paper, we introduce a new algorithm, named WordGraph2Vec, or in short WG2V, which combines the two approaches to gain the benefits of both. The algorithm uses a directed word graph to provide additional information for sequential text input algorithms. Our experiments on benchmark datasets show that text classification algorithms are nearly as accurate with WG2V as with other word embedding models while preserving more stable accuracy rankings.

Cite

CITATION STYLE

APA

Zuckerman, M., & Last, M. (2019). Using graphs for word embedding with enhanced semantic relations. In EMNLP-IJCNLP 2019 - Graph-Based Methods for Natural Language Processing - Proceedings of the 13th Workshop (pp. 32–41). Association for Computational Linguistics (ACL). https://doi.org/10.18653/v1/d19-5305

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free