Paper

Skip-gram word embeddings in hyperbolic space

Recent work has demonstrated that embeddings of tree-like graphs in hyperbolic space surpass their Euclidean counterparts in performance by a large margin. Inspired by these results and scale-free structure in the word co-occurrence graph, we present an algorithm for learning word embeddings in hyperbolic space from free text... (read more)

Results in Papers With Code
(↓ scroll down to see all results)