pith. sign in

arxiv: 1808.05907 · v1 · pith:L7WUFY2Lnew · submitted 2018-08-14 · 💻 cs.CL

Syntree2Vec - An algorithm to augment syntactic hierarchy into word embeddings

classification 💻 cs.CL
keywords embeddingsalgorithmdatasyntacticwordaccuracyaimsaugment
0
0 comments X
read the original abstract

Word embeddings aims to map sense of the words into a lower dimensional vector space in order to reason over them. Training embeddings on domain specific data helps express concepts more relevant to their use case but comes at a cost of accuracy when data is less. Our effort is to minimise this by infusing syntactic knowledge into the embeddings. We propose a graph based embedding algorithm inspired from node2vec. Experimental results have shown that our algorithm improves the syntactic strength and gives robust performance on meagre data.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.