MétaCan
Menu
Retour à la cohorte
Enregistrement W2777339208

On-line Reference Assignment for Anaphoric and Non-Anaphoric Nouns: A Unified, Memory-Based Model in ACT-R - eScholarship

2007· article· en· W2777339208 sur OpenAlexaboutno aff
Aryn Pyke, Robert West, Jo‐Anne LeFevre

Notice bibliographique

RevueProceedings of the Annual Meeting of the Cognitive Science Society · 2007
Typearticle
Langueen
DomainePsychology
ThématiqueLanguage, Metaphor, and Cognition
Établissements canadiensnon disponible
Organismes subventionnairesnon disponible
Mots-clésReferentAntecedent (behavioral psychology)NounPropositionLinguisticsComputer scienceProper nounNoun phraseCognitive sciencePsychologyArtificial intelligencePhilosophySocial psychology
DOInon disponible

Résumé

récupéré en direct d'OpenAlex

On-line Reference Assignment for Anaphoric and Non-Anaphoric Nouns: A Unified, Memory-Based Model in ACT-R Aryn Pyke (aryn.pyke@gmail.com) Institute of Cognitive Science, Carleton University, 1125 Colonel By Drive Ottawa, ON K1S 5B6 Canada Robert L. West (rlwest@connect.carleton.ca) Jo-Anne LeFevre (jlefevre@connect.carleton.ca) Institute of Cognitive Science, 1125 Colonel By Drive Ottawa, ON K1S 5B6 Canada Department of Psychology, 1125 Colonel By Drive Ottawa, ON K1S 5B6 Canada Sengul, 1979; Kintsch & van Dijk, 1978; O'Brien, Plewes, & Albrecht, 1990). In such strategic-search models, the discourse might be mentally represented as a proposition network, and the reader might systematically troll backwards through it in search of the antecedent that (according to some criterion) could constitute a match to the current anaphor term. After all, how else could we account for the fact that readers come across the right referent (i.e., the particular one mentioned earlier in the discourse)? An answer to this “How else” question is furnished by the memory-based view of text processing (see Gerrig & O’Brien, 2005 for a review). According to the memory- based view, the successful retrieval of a referent need not require (or constitute evidence of) a strategic, proactive search, because passive general-purpose memory processes often can automatically bring the intended referent to mind. In particular, under the resonance model (e.g., Gernsbacher, 1989; Myers & O’Brien, 1998) current information in working memory (i.e., the anaphoric noun) serves as a cue that automatically boosts activation of other entities throughout long-term memory -- including, ideally, the intended referent -- in accord with their conceptual overlap with the cue. Thus, at the time the anaphor ‘fruit’ in (2) is encountered, the apple referent can be automatically re- activated via resonance in virtue of its conceptual overlap with the anaphor (a pre-existing conceptual association). Certainly higher-level and pragmatic processes may also play a role in comprehension. However, to account for readers’ frequent success at referent reactivation during (first-pass) anaphor processing, we agree that there may be “no need to invoke any process other than general memory processing” (Gerrig & O’Brien, 2005, p. 230). The computational model in the present paper constitutes an existence proof that memory-based models are indeed sufficient, not only in principle, but in practice, to account for a high rate of success at first-pass referent retrieval. The present paper and model also identify and address a fundamental, but we believe, previously neglected and under-estimated problem: The Anaphoric Classification Problem. In particular, how (and how accurately) can readers judge whether or not a noun is anaphoric during first-pass processing? Our model demonstrates how the memory-based view can be operationalized to address this classification problem, and in particular, to predict when a Abstract The computational model in present paper confirms that memory-based accounts are sufficient to account for a high rate of success at first-pass referent retrieval for anaphoric (and non-anaphoric) nouns. Because even definite noun phrases can often be non-anaphoric (e.g., Poesio & Vieira, 1998), an adequate model must account for how a reader makes an explicit or implicit decision about the anaphoric status of a noun (herein: The Anaphoric Classification Problem). We explain why we are inclined to reject the conventional intuition that: the failure to find/retrieve a referent within the discourse then, serially, leads to treating a (possibly anaphoric) noun as a new referent. Instead, we extend the memory-based account to address this classification problem. We suggest that LTM contains both generic referent types and specific referent tokens, which simultaneously compete for retrieval via resonance. The nature of what is retrieved (token vs. type) determines whether the reader effectively treats a noun as anaphoric or not. Our model predicts whether an anaphor in a given text will be misinterpreted as a new referent during first-pass processing. The influence of anaphor word choice is explained, and encompasses metaphoric anaphors. Keywords: noun anaphora; memory-based text processing; resonance; reference assignment; cognitive modeling; ACT-R Introduction An anaphoric noun is one that denotes a referent that was previously mentioned in the discourse, but possibly using a different antecedent term. For example, in (2) “fruit” (or “apple”) is used anaphorically to denote the referent introduced by the antecedent “apple” in (1). (1) John bought an apple. (2) John enjoyed the fruit/apple. Readers are often able to re-activate the intended referent 1 almost immediately after encountering an anaphoric noun (Dell, McKoon, & Ratcliff, 1983; Sanford & Garrod, 1989) that is, after the first-pass processing of the noun. To account for this on-line ability, some models suggest that when a reader encounters an anaphoric noun, he/she undertakes a strategic search for an antecedent through a representation of the discourse context (e.g., Clark & The term ‘referent’ is being used here in the cognitive sense (as in Gundel, Hedberg, & Zacharski, 2001) to mean the mental representation of the entity (person or object) in question.

Récupéré en direct depuis OpenAlex et désinversé. Les résumés ne sont pas conservés dans cette base de données : les index inversés représentent 8,6 Go des 9,3 Go de texte de la base, et le serveur dispose de 13 Go libres.

Comment cette classification a été obtenuedéplier

Prédiction distillée sur la base complète

Imitation des enseignants

Ni prévalence calibrée, ni vérité terrain. Validation humaine à venir. Apprise à partir de 10 348 étiquettes directes de Codex et de 10 348 étiquettes directes de Gemma. Le mode candidate est l'union des têtes enseignantes seuillées; le consensus est leur intersection. Ces sorties portent le statut machine_predicted_unvalidated et ne sont ni des étiquettes humaines ni des étiquettes directes de modèles de pointe.

score de la tête « metaresearch » (Codex)0,006
score de la tête « metaresearch » (Gemma)0,002
Version: codex-gemma-dda1882f352aStatut de validation: machine_predicted_unvalidated
Catégories candidatesaucune
Catégories consensuellesaucune
DomaineSignal candidat: aucune · Signal consensuel: aucune
Devis d'étudeSignal candidat: Expérimental (laboratoire) · Signal consensuel: Expérimental (laboratoire)
GenreSignal candidat: Empirique · Signal consensuel: Empirique
Score de désaccord entre enseignants0,039
Score d'incertitude au seuil0,608

Scores Codex et Gemma par catégorie

CatégorieCodexGemma
Métarecherche0,0060,002
Méta-épidémiologie (sens strict)0,0000,000
Méta-épidémiologie (sens large)0,0000,000
Bibliométrie0,0000,002
Études des sciences et des technologies0,0000,001
Communication savante0,0000,000
Science ouverte0,0010,000
Intégrité de la recherche0,0000,000
Charge utile insuffisante (le modèle a refusé de juger)0,0000,000

Scores machine (provisoires)

Les deux têtes enseignantes du modèle étudiant, lues sur ce travail. Un score ordonne la base pour la relecture; il n'affirme jamais une catégorie, et le statut de validation accompagne chaque rangée tel quel.

Scores de référence d'un modèle non mature (critères de maturité non atteints, 7 itérations). Un score ordonne; il n'affirme jamais une catégorie.

Tête enseignante Opus0,038
Tête enseignante GPT0,324
Écart entre enseignants0,285 · la distance entre les deux têtes enseignantes sur ce seul travail
Statut de validationscore_only:v0-immature-baseline · tel quel depuis la passe de notation : score_only signifie que le nombre peut ordonner les travaux, et qu'aucune étiquette de catégorie n'en découle

Classification

machine, non validée

Prédiction automatique; un appel candidat d’une seule tête enseignante, pas un consensus.

Les modèles n’ont appliqué aucune catégorie : rien dans la taxonomie ne correspondait à ce travail.
Devis d'étudeExpérimental (laboratoire)
Domainenon disponible
GenreEmpirique

Le détail, modèle par modèle et score par score, se trouve en fin de page sous « Comment cette classification a été obtenue ».

En bref

Citations0
Publié2007
Routes d'admission1
Résumé présentoui

Explorer davantage

Même revueProceedings of the Annual Meeting of the Cognitive Science SocietyMême sujetLanguage, Metaphor, and CognitionTravaux en français237 207