On the Practical Ability of Recurrent Neural Networks to Recognize Hierarchical Languages

5Citations
Citations of this article
74Readers
Mendeley users who have this article in their library.

Abstract

While recurrent models have been effective in NLP tasks, their performance on context-free languages (CFLs) has been found to be quite weak. Given that CFLs are believed to capture important phenomena such as hierarchical structure in natural languages, this discrepancy in performance calls for an explanation. We study the performance of recurrent models on Dyck-n languages, a particularly important and well-studied class of CFLs. We find that while recurrent models generalize nearly perfectly if the lengths of the training and test strings are from the same range, they perform poorly if the test strings are longer. At the same time, we observe that recurrent models are expressive enough to recognize Dyck words of arbitrary lengths in finite precision if their depths are bounded. Hence, we evaluate our models on samples generated from Dyck languages with bounded depth and find that they are indeed able to generalize to much higher lengths. Since natural language datasets have nested dependencies of bounded depth, this may help explain why they perform well in modeling hierarchical dependencies in natural language data despite prior works indicating poor generalization performance on Dyck languages. We perform probing studies to support our results and provide comparisons with Transformers.

Cite

CITATION STYLE

APA

Bhattamishra, S., Ahuja, K., & Goyal, N. (2020). On the Practical Ability of Recurrent Neural Networks to Recognize Hierarchical Languages. In COLING 2020 - 28th International Conference on Computational Linguistics, Proceedings of the Conference (pp. 1481–1494). Association for Computational Linguistics (ACL). https://doi.org/10.18653/v1/2020.coling-main.129

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free