login

Tailoring Continuous Word Representations for Dependency Parsing

Published 1 January 2014Open access
Mohit Bansal, Kevin Gimpel, Karen Livescu
Citations300
View PDF

TL;DR

It is found that all embeddings yield significant parsing gains, including some recent ones that can be trained in a fraction of the time of others, suggesting their complementarity.

Abstract

Word representations have proven useful for many NLP tasks, e.g., Brown clusters as features in dependency parsing (Koo et al., 2008). In this paper, we investigate the use of continuous word representations as features for dependency parsing. We com-pare several popular embeddings to Brown clusters, via multiple types of features, in both news and web domains. We find that all embeddings yield significant parsing gains, including some recent ones that can be trained in a fraction of the time of oth-ers. Explicitly tailoring the representations for the task leads to further improvements. Moreover, an ensemble of all representa-tions achieves the best results, suggesting their complementarity. 1

Keywords

Computer Science