Long-Distance Dependencies Don’t Have to Be Long: Simplifying through Provably (Approximately) Optimal Permutations

Long-Distance Dependencies Don’t Have to Be Long: Simplifying through Provably (Approximately) Optimal Permutations Rishi Bommasani author 2019-07 text Proceedings of the 57th Annual Meeting of the Association for Computational Linguistics: Student Research Workshop Fernando Alva-Manchego editor Eunsol Choi editor Daniel Khashabi editor Association for Computational Linguistics Florence, Italy conference publication bommasani-2019-long 10.18653/v1/P19-2012 https://aclanthology.org/P19-2012/ 2019-07 89 99