Article Title

Colorless green recurrent networks dream hierarchically

Authors

Kristina Gulordava, Universitat Pompeu FabraFollow
Piotr Bojanowski, Facebook AI Research, ParisFollow
Edouard Grave, Facebook AI Research, New YorkFollow
Tal Linzen, Johns Hopkins UniversityFollow
Marco Baroni, Facebook AI Research, ParisFollow

DOI

https://doi.org/10.7275/zb8y-wg03

Recommended Citation

Gulordava, Kristina; Bojanowski, Piotr; Grave, Edouard; Linzen, Tal; and Baroni, Marco (2019) "Colorless green recurrent networks dream hierarchically," Proceedings of the Society for Computation in Linguistics: Vol. 2, Article 48.
DOI: https://doi.org/10.7275/zb8y-wg03
Available at: https://scholarworks.umass.edu/scil/vol2/iss1/48