Papers by Matan Zuckerman
Using Graphs for Word Embedding with Enhanced Semantic Relations (D19-53)
Copied to clipboard
| Challenge: | Word embedding algorithms are based on sequential text input, while others are utilizing a graph representation of text. |
| Approach: | They propose a word embedding algorithm based on a directed word graph to provide additional information for sequential text input algorithms. |
| Outcome: | The proposed algorithm is based on a directed word graph to provide additional information for sequential text input algorithms. |