The symbol-grounding problem in numerical cognition: A review of theory, evidence, and outstanding questions.
Bibliographic record
Abstract
How do numerical symbols, such as number words, acquire semantic meaning? This question, also referred to as the "symbol-grounding problem," is a central problem in the field of numerical cognition. Present theories suggest that symbols acquire their meaning by being mapped onto an approximate system for the nonsymbolic representation of number (Approximate Number System or ANS). In the present literature review, we first asked to which extent current behavioural and neuroimaging data support this theory, and second, to which extent the ANS, upon which symbolic numbers are assumed to be grounded, is numerical in nature. We conclude that (a) current evidence that has examined the association between the ANS and number symbols does not support the notion that number symbols are grounded in the ANS and (b) given the strong correlation between numerosity and continuous variables in nonsymbolic number processing tasks, it is next to impossible to measure the pure association between symbolic and nonsymbolic numerosity. Instead, it is clear that significant cognitive control resources are required to disambiguate numerical from continuous variables during nonsymbolic number processing. Thus, if there exists any mapping between the ANS and symbolic number, then this process of association must be mediated by cognitive control. Taken together, we suggest that studying the role of both cognitive control and continuous variables in numerosity comparison tasks will provide a more complete picture of the symbol-grounding problem.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.004 | 0.008 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.002 | 0.001 |
| Bibliometrics | 0.006 | 0.007 |
| Science and technology studies | 0.001 | 0.010 |
| Scholarly communication | 0.004 | 0.008 |
| Open science | 0.003 | 0.002 |
| Research integrity | 0.003 | 0.004 |
| Insufficient payload (model declined to judge) | 0.003 | 0.001 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".