Why transformers are obviously good models of language

Felix Hill
8/7/2024
cs.CL

No confident code implementation found for this paper. 3 possible matches can be shown below.

Abstract

Nobody knows how language works, but many theories abound. Transformers are a class of neural networks that process language automatically with more success than alternatives, both those based on neural computations and those that rely on other (e.g. more symbolic) mechanisms. Here, I highlight direct connections between the transformer architecture and certain theoretical perspectives on language. The empirical success of transformers relative to alternative models provides circumstantial evidence that the linguistic approaches that transformers embody should be, at least, evaluated with greater scrutiny by the linguistics community and, at best, considered to be the currently best available theories.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 3 weaker matches are hidden by default — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{hill2024transformers,
  title  = {Why transformers are obviously good models of language},
  author = {Felix Hill},
  year   = {2024},
  eprint = {2408.03855},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2408.03855v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2408.03855.svg)](https://codeofpaper.com/paper/2408.03855)

Discussion