BME HLT | Stanford’s Graph-based Neural Dependency Parser

Stanford’s Graph-based Neural Dependency Parser

Gábor Recski
Sept. 14, 2017, 8:15
MTA SZTAKI, Lágymányosi u. 11, Rm 306 or 506

On the 14th of September, Gábor Recski will require our help to fully understand the system that won the CoNLL-2017 shared task on Universal Dependency parsing. The system is presented in (Dozat et. al 2017b) and is mostly based on the system described in (Dozat et. al 2017b), which is in turn an extension of a system presented in the TACL paper by (Kiperwasser & Goldberg 2016). All help is appreciated!