@inproceedings{Bommasani_2019,<br/><span class="tab"></span> title={Long-Distance Dependencies Don’t Have to Be Long: Simplifying through Provably (Approximately) Optimal Permutations},<br/><span class="tab"></span> url={http://dx.doi.org/10.18653/v1/p19-2012},<br/><span class="tab"></span> DOI={10.18653/v1/p19-2012},<br/><span class="tab"></span> booktitle={Proceedings of the 57th Annual Meeting of the Association for Computational Linguistics: Student Research Workshop},<br/><span class="tab"></span> publisher={Association for Computational Linguistics},<br/><span class="tab"></span> author={Bommasani,<br/><span class="tab"></span> Rishi},<br/><span class="tab"></span> year={2019} }