@inproceedings{zuckerman-last-2019-using,
    title = "Using Graphs for Word Embedding with Enhanced Semantic Relations",
    author = "Zuckerman, Matan  and
      Last, Mark",
    editor = "Ustalov, Dmitry  and
      Somasundaran, Swapna  and
      Jansen, Peter  and
      Glava{\v{s}}, Goran  and
      Riedl, Martin  and
      Surdeanu, Mihai  and
      Vazirgiannis, Michalis",
    booktitle = "Proceedings of the Thirteenth Workshop on Graph-Based Methods for Natural Language Processing (TextGraphs-13)",
    month = nov,
    year = "2019",
    address = "Hong Kong",
    publisher = "Association for Computational Linguistics",
    url = "https://preview.aclanthology.org/add-emnlp-2024-awards/D19-5305/",
    doi = "10.18653/v1/D19-5305",
    pages = "32--41",
    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."
}