Affiliation:
1. Department of Computer Science, University College London, London, UK
Abstract
Sheaves are mathematical objects that describe the globally compatible data associated with open sets of a topological space. Original examples of sheaves were continuous functions; later they also became powerful tools in algebraic geometry, as well as logic and set theory. More recently, sheaves have been applied to the theory of contextuality in quantum mechanics. Whenever the local data are not necessarily compatible, sheaves are replaced by the simpler setting of presheaves. In previous work, we used presheaves to model lexically ambiguous phrases in natural language and identified the order of their disambiguation. In the work presented here, we model syntactic ambiguities and study a phenomenon in human parsing called garden-pathing. It has been shown that the information-theoretic quantity known as ‘surprisal’ correlates with human reading times in natural language but fails to do so in garden-path sentences. We compute the degree of signalling in our presheaves using probabilities from the large language model
BERT
and evaluate predictions on two psycholinguistic datasets. Our degree of signalling outperforms surprisal in two ways: (i) it distinguishes between hard and easy garden-path sentences (with a
p
-value
<
10
−
5
), whereas existing work could not, (ii) its garden-path effect is larger in one of the datasets (32 ms versus 8.75 ms per word), leading to better prediction accuracies.
This article is part of the theme issue ‘Quantum contextuality, causality and freedom of choice’.
Funder
Royal Academy of Engineering Senior Research Fellowship/Research Chair
Engineering and Physical Sciences Research Council
Reference43 articles.
1. Théorie des points fixes : indice total et nombre de Lefschetz
2. Sur quelques points d’algèbre homologique, I;Grothendieck A;Tohoku Math. J.,1957
3. The sheaf-theoretic structure of non-locality and contextuality
4. Abramsky S Barbosa RS Kishida K Lal R Mansfield S. 2015 Contextuality cohomology and paradox. In Twenty-Fourth EACSL Annual Conf. on Computer Science Logic vol. 41 Berlin Germany 6-9 September 2015 pp. 211–228. Leibniz International Proceedings in Informatics. Dagstuhl Germany: Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
5. Kishida K. 2023 Godel Escher Bell: contextual semantics of logical paradoxes. In Logic and structure in computer science and beyond outstanding contributions to logic in honour of Samson Abramsky (eds A Palmigiano M Sadrzadeh) vol. 25 pp. 531-572. Berlin Germany: Springer.