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

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]

Abstract

Abstract is missing.