z-logo
open-access-imgOpen Access
Processing and Recall of Compatible and Incompatible Question and Answer Pairs
Author(s) -
Samuel Fillenbaum
Publication year - 1971
Publication title -
language and speech
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.713
H-Index - 52
eISSN - 1756-6053
pISSN - 0023-8309
DOI - 10.1177/002383097101400306
Subject(s) - recall , commit , class (philosophy) , task (project management) , variety (cybernetics) , psychology , sentence , natural language processing , cognitive psychology , linguistics , computer science , social psychology , artificial intelligence , philosophy , management , database , economics
Anyone who knows a language can tell whether an answer is compatible (C) or incompatible (I) with a question. Subjects were presented with a variety of C and I question and answer pairs and allowed as much time as they required to commit each to memory. It was found that subjects took longer for the initial processing of I items than of C items, with performance on the fastest I sub-class worse than performance on the slowest C sub-class. Nevertheless, at recall subjects did worse on I items than C items, with performance on the best I sub-class worse than that on the poorest C sub-class. The most popular error on I items was such as to change these to C items. Subjects' knowledge of the linguistic constraints obtaining across a sentence boundary systematically affected performance. The task ahead is to specify how this may happen.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom