This architecture is connected with previous work on incorporating word embeddings into a linear model.
deterministic transition-based parsers works by making a sequence of greedy local decisions (Nivre et al., 2004;Honnibal et al., 2013;Goldberg et al., 2014;Gómez-Rodríguez and Fernández-González, 2015).