SOTAVerified

Graph-based Syntactic Word Embeddings

2020-12-01COLING (TextGraphs) 2020Unverified0· sign in to hype

Ragheb Al-Ghezi, Mikko Kurimo

Unverified — Be the first to reproduce this paper.

Reproduce

Abstract

We propose a simple and efficient framework to learn syntactic embeddings based on information derived from constituency parse trees. Using biased random walk methods, our embeddings not only encode syntactic information about words, but they also capture contextual information. We also propose a method to train the embeddings on multiple constituency parse trees to ensure the encoding of global syntactic representation. Quantitative evaluation of the embeddings show a competitive performance on POS tagging task when compared to other types of embeddings, and qualitative evaluation reveals interesting facts about the syntactic typology learned by these embeddings.

Tasks

Reproductions