Hostname: page-component-76d6cb85b7-6jg5l Total loading time: 0 Render date: 2026-07-12T09:59:09.253Z Has data issue: false hasContentIssue false

Generative Grammar, Neural Networks, and the Implementational Mapping Problem: Response to Pater

Published online by Cambridge University Press:  01 January 2026

Ewan Dunbar*
Affiliation:
CNRS, Université Paris Diderot, and Université Sorbonne Paris Cité
*
Laboratoire de Linguistique Formelle, CNRS, Université Paris Diderot, and Université Sorbonne Paris Cité [ewan.dunbar@univ-paris-diderot.fr]

Abstract

The target article (Pater 2019) proposes to use neural networks to model learning within existing grammatical frameworks. This is easier said than done. There is a fundamental gap to be bridged that does not receive attention in the article: how can we use neural networks to examine whether it is possible to learn some linguistic representation (a tree, for example) when, after learning is finished, we cannot even tell if this is the type of representation that has been learned (all we see is a sequence of numbers)? Drawing a correspondence between an abstract linguistic representational system and an opaque parameter vector that can (or perhaps cannot) be seen as an instance of such a representation is an implementational mapping problem. Rather than relying on existing frameworks that propose partial solutions to this problem, such as harmonic grammar, I suggest that fusional research of the kind proposed needs to directly address how to ‘find’ linguistic representations in neural network representations.

Information

Type
Perspectives
Copyright
Copyright © 2019 Linguistic Society of America

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable