paper-with-me

홈 › Papers

Evaluating Transformer's Ability to Learn Mildly Context-Sensitive Languages

2023-09-02 · Shunjie Wang, Shane Steinert-Threlkeld

Despite the fact that Transformers perform well in NLP tasks, recent studies suggest that self-attention is theoretically limited in learning even some regular and context-free languages. These findings motivated us to think about their implications in modeling natural language, which is hypothesized to be mildly context-sensitive. We test the Transformer's ability to learn mildly context-sensitive languages of varying complexities, and find that they generalize well to unseen in-distribution data, but their ability to extrapolate to longer strings is worse than that of LSTMs. Our analyses show that the learned self-attention patterns and representations modeled dependency relations and demonstrated counting behavior, which may have helped the models solve the languages.

📄 PDF Abstract BibTeX arXiv:2309.00857

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

A Transformer with Stack Attention

2024-05-07 · Jiaoda Li, Jennifer C. White, Mrinmaya Sachan, Ryan Cotterell

Natural languages are believed to be (mildly) context-sensitive. Despite underpinning remarkably capable large language models, transformers are unable to model many context-free language tasks. In an attempt to address …

Language ModelingLanguage Modelling

Comparing methods of tree-construction across mildly context-sensitive formalisms

2021-02-01 · SCiL 2021 2 · Tim Hunter, Robert Frank

On the Complexity of CCG Parsing

2017-02-21 · CL 2018 9 · Marco Kuhlmann, Giorgio Satta, Peter Jonsson

We study the parsing complexity of Combinatory Categorial Grammar (CCG) in the formalism of Vijay-Shanker and Weir (1994). As our main result, we prove that any parsing algorithm for this formalism will take in the worst…

SentenceTAG

The Logic for a Mildly Context-Sensitive Fragment of the Lambek-Grishin Calculus

2021-01-10 · Hiroyoshi Komatsu

While context-free grammars are characterized by a simple proof-theoretic grammatical formalism namely categorial grammar and its logic the Lambek calculus, no such characterizations were known for tree-adjoining grammar…

Unsupervised Discontinuous Constituency Parsing with Mildly Context-Sensitive Grammars

2022-12-18 · Songlin Yang, Roger P. Levy, Yoon Kim

We study grammar induction with mildly context-sensitive grammars for unsupervised discontinuous parsing. Using the probabilistic linear context-free rewriting system (LCFRS) formalism, our approach fixes the rule struct…

Constituency Parsingparameter estimationTensor Decomposition