CoChat

Provable Limitations of Acquiring Meaning from Ungrounded Form: What Will Future Language Models Understand?

Open access
Merrill, William, Goldberg, Yoav, Schwartz, Roy, Smith, Noah A. · 2021 · Transactions of the Association for Computational Linguistics

The DOI matches its Crossref record; 26 of the 27 references it cites were found in a registry or an index.

Abstract

Language models trained on billions of tokens have recently led to unprecedented results on many NLP tasks. This success raises the question of whether, in principle, a system can ever “understand” raw text without access to some form of grounding. We formally investigate the abilities of ungrounded systems to acquire meaning. Our analysis focuses on the role of “assertions”: textual contexts that provide indirect clues about the underlying semantics. We study whether assertions enable a system to emulate representations preserving semantic relations like equivalence. We find that assertions enable semantic emulation of languages that satisfy a strong notion of semantic transparency. However, for classes of languages where the same expression can take different values in different contexts, we show that emulation can become uncomputable. Finally, we discuss differences between our formal model and natural language, exploring how our results generalize to a modal setting and other semantic relations. Together, our results suggest that assertions in code or language do not provide sufficient signal to fully emulate semantic representations. We formalize ways in which ungrounded language models appear to be fundamentally limited in their ability to “understand”.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1162/tacl_a_00412

Cites

26 of 26 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Research works printed but not linked: 6

  1. Chomsky, 1965, Aspects of the Theory of Syntax
  2. Horn, 2020, Negation
  3. Pratt-Hartmann, 2006, More fragments of language, Notre Dame Journal of Formal Logic, 47, 151, 10.1305/ndjfl/1153858644 · DOI
  4. Fintel, 2011, Intensional semantics, Unpublished Lecture Notes
  5. Whitehead, 1925–1927, Principia Mathematica
  6. Yogatama, 2019, Learning and evaluating general linguistic intelligence. arXiv: 1901 .11373

Cited by

See all 48

Metadata

Authors
Merrill, W., Goldberg, Y., Schwartz, R., & Smith, N. A.
Affiliations
  • Allen Institute for Artificial Intelligence (US)
  • Bar-Ilan University (IL)
  • University of Washington (US)
Venue
Transactions of the Association for Computational Linguistics
Publisher
MIT Press
Published
2021
Volume
9
Pages
1047-1060
ISSN
2307-387X (ISSN-L)
OpenAlex
W3156509887
Cited by
44
References
27
Citations by year
2026: 6 · 2025: 3 · 2024: 1 · 2023: 14 · 2022: 16 · 2021: 4
FWCI
34.56
Type
journal article
Language
en
Open access
Locations
  • Transactions of the Association for Computational Linguistics (publishedVersion, cc-by)
  • arXiv (Cornell University) (submittedVersion)
  • DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion, cc-by-sa)
  • arXiv (Cornell University)
Funders
Allen Institute for Artificial Intelligence
Topics
  • Social Sciences › Arts and Humanities › Language and Linguistics › Syntax, Semantics, Linguistic Variation
  • Physical Sciences › Computer Science › Artificial Intelligence › Logic, Reasoning, and Knowledge
  • Physical Sciences › Computer Science › Artificial Intelligence › Natural Language Processing Techniques
Keywords
meaning acquisition, assertion, semantic transparency, uncomputability, semantic relations, equivalence, modal logic, formal semantics, language comprehension

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.