Rishi Bommasani. Long-Distance Dependencies Don't Have to Be Long: Simplifying through Provably (Approximately) Optimal Permutations. In Fernando Alva-Manchego, Eunsol Choi, Daniel Khashabi, editors, Proceedings of the 57th Conference of the Association for Computational Linguistics, ACL 2019, Florence, Italy, July 28 - August 2, 2019, Volume 2: Student Research Workshop. pages 89-99, Association for Computational Linguistics, 2019. [doi]
@inproceedings{Bommasani19,
title = {Long-Distance Dependencies Don't Have to Be Long: Simplifying through Provably (Approximately) Optimal Permutations},
author = {Rishi Bommasani},
year = {2019},
url = {https://www.aclweb.org/anthology/P19-2012/},
researchr = {https://researchr.org/publication/Bommasani19},
cites = {0},
citedby = {0},
pages = {89-99},
booktitle = {Proceedings of the 57th Conference of the Association for Computational Linguistics, ACL 2019, Florence, Italy, July 28 - August 2, 2019, Volume 2: Student Research Workshop},
editor = {Fernando Alva-Manchego and Eunsol Choi and Daniel Khashabi},
publisher = {Association for Computational Linguistics},
isbn = {978-1-950737-47-5},
}