Recognition Failure Research Articles

Recognition failure and integration.

If a recognition test is followed by a cued recall test then the probability of recognition given recall generally follows the Tulving-Wiseman function. Despite this regularity two types of exceptions have been discovered. Both poor integration and cue overlap causes an observed value of recognition given recall that is higher than predicted. The present study explores the first type of exception by proposing and testing an analytical tool, which emanates from confidence ratings given to recall responses, for relating poor integration directly to variations in the degree of deviation from the function. It is demonstrated that very poor integration produces a deviation above the function, whereas a very good integration produces a deviation below the function. The effect of integration (and cue overlap) is explained by means of a conceptualization cue dependency. Support is also given to the notion that an enhanced variability of goodness of encoding contributes to an enhanced dependence between recall and recognition.

On serial recall: A critique of chaining in the theory of distributed associative memory.

Lewandowsky and Murdock (1989) proposed a model for serial recall based on the theory of distriuted associative memory. The authors criticize 3 aspects of the model. First, recall is based, in the model, on a chain of associations. Once an error has been made, the chain is broken. To lengthen the chain, a tacit response (a facsimile vector) is used as a retrieval probe. The authors show that a facsimile vector is not an effective retrieval cue. Second, the model is biased against items at the beginning of a list, and, because of the bias, response alternatives must be limited in an artificial way. Third, the model implies that recognition failure of recallable items is a routine characteristic of memory-span tasks

The tulving-wiseman law and recognition failure of recognisable words

Abstract All the data that contribute to the recognition failure function discovered by Tulving and Wiseman (1975) come from experimental conditions in which B items are studied alongside A items that are omitted from a recognition test but are presented as cues in a subsequent recall test. According to a contextual account of this function, and of exceptions to it, data approximate the function whenever the A items in the recall test provide different contextual information to that provided by the B items in the recognition test. In line with this account, three experiments show that data also approximate the function when, following a recognition test involving only the B items, the A items are presented alongside the B items in a second recognition test. The third experiment further shows that data diverge from the function under similar conditions to those that have previously been shown to produce an exception to the function when the second test is cued recall; namely, conditions under which the A i...

Mathematical constraints and the Tulving-Wiseman law: a rejoinder.

Hintzman (1991; 1992) has claimed that the reason data points approximate the recognition failure function discovered by Tulving and Wiseman (1975) is that they are mathematically constrained to do so, and the reason that a few data points do not approximate the function, but are exceptions to it, is that these data points are less subject to mathematical constraints. He has additionally argued that such exceptions are more likely with low levels of recall and strong underlying sources of positive covariance. We provide empirical evidence relevant to this mathematical model using 301 observations from a database of all relevant experimental conditions published between 1973 and 1992 (Nilsson & Gardiner, 1993). We conclude that mathematical constraints have only a minor influence on the function, not the causal role assigned to them in Hintzman's (1992) model. By our account, both the function and exceptions to it reflect a single psychological principle, the functional effectiveness of contextual cues.

Recognition failure, associative relatedness, and recognition memory

The encoding-specificity recognition-failure paradigm was employed in four experiments. The materials presented during encoding were identical in all four. These word pairs varied in associative relatedness in an asymmetrical manner. They also varied in level of associative relatedness. As expected, the results showed substantial amounts of recognition failure when the dominant direction of associative relatedness went from cue to target. Very little recognition failure was observed in the target-to-cue associative relatedness condition. These findings are discussed in the context of factors leading to the phenomenon of recognition failure and to the relationship between recall and recognition.

Identifying exceptions in a database of recognition failure studies from 1973 to 1992.

This paper presents a database of all published studies based on the recognition failure paradigm, which involves the study of pairs of items followed by a recognition test of the second item of each pair and a recall test of the same target item with the first item of each pair provided as a context cue. The paper also identifies, on the basis of a quantitative analysis, exceptions to the recognition failure function encompassing most data in the database. The database includes reference information about each study and a short description of materials and the manipulations made in each of the 302 experimental conditions reported. The database also includes information about the total number of observations for each condition, the overall hit rate in free or forced choice recognition, the overall probability of recall, the observed probability of recognition given recall, the predicted probability of recognition given recall, the difference between observed and predicted values, and the critical ratio between these difference scores and their overall standard deviation.

Sequence Recognition with Recurrent Neural Networks

Abstract The simple recurrent network (SRN) introduced by Elman (1990) can be trained to predict each successive symbol of any sequence in a particular language, and thus act as a recognizer of the language. Here, we show several conditions occurring within the class of regular languages that result in recognition failure by any SRN with a limited number of nodes in the hidden layer. Simulation experiments show how modified versions of the SRN can overcome these failure conditions. In one case, it is found to be necessary to train the SRN to show at its output units both the current input symbol as well as the predicted symbol. In another case, the SRN must show the current contents of the context units. It is shown that the SRN with both modifications, called the auto-associative recurrent network (AARN), overcomes the identified conditions for SRN failure, even when they occur simultaneously. However, it cannot be trained to recognize all of the regular languages.

Recognition-failure constraints and the average maximum.

The Tulving-Wiseman function of recognition failure of recallable words is defined by the relation between the conditional probability of recognition given recall, P(Rn/Rc), and the probability of recognition, P(Rn). Hintzman (1993) proposed a distinction between algebraic maximum and average maximum values of P(Rn/Rc) to support his earlier claims (Hintzman, 1992) that the Tulving-Wiseman function is a mathematical artifact. This article shows that the distinction depends on a crucial assumption of Hintzman's argument that is unjustified on both empirical and rational grounds

Recognition failure of recallable words: Exception due to poor integration

The phenomenon of recognition failure of recallable words shows a remarkable regularity across a wide variety of experimental conditions. A quadratric function, referred to as the Tulving‐Wiseman function, summarizes this regularity. A few cases of deviation from this function have been identified and classified into two categories of exceptions to this function. An experiment was designed to deal with one of these categories, namely the exception that occurs because of poor integration between cue and target information of studied word pairs. An index based on confidence ratings of recall responses was developed to assess variability in integration. Poor integration was demonstrated especially for one presentation of low associative word pairs, and significant deviations from the function was obtained for this condition. Hintzman's (1991, 1992) hypothesis about mathematical constraints of the Tulving‐Wiseman function was discussed and refuted. Finally, an interpretation of negative deviations from the Tulving‐Wiseman function was proposed.

Target recognition failure by the nonspecific defense system: surface constituents of pathogens interfere with the alternative pathway of complement activation.

Target recognition failure by the nonspecific defense system: surface constituents of pathogens interfere with the alternative pathway of complement activation.

Exceptions to recognition failure as a function of the encoded association between cue and target

The relation of the recognition failure of recallable words to overall recognition rates is largely invariant across conditions that influence both recall and recognition separately. In two experiments, the influence of the integration of the members of A-B word pairs on this relation was investigated. In Experiment 1, it was found that deviations of observed recognition failure from predictions of the Tulving-Wiseman function (Tulving & Wiseman, 1975) were produced by shallow, nonsemantic encoding. In Experiment 2, the association of category-to-instance pairs was varied. It was found that weak associates caused larger deviations of observed recognition failure from predicted recognition failure than did strong associates. Such results suggest that a strongly encoded association between cue and target elements of A-B pairs is a necessary condition for the adherence of data to the Tulving-Wiseman function. The implications of these findings for general models of memory are discussed.

Recognition failure and the composite memory trace in CHARM.

Recognition failure and the composite memory trace in CHARM.

Recognition failure and the composite memory trace in CHARM.

The relation between recognition and recall, and especially the orderly recognition-failure function relating recognition and the recognizability of recallable words, was investigated using a composite holographic associative recall-recognition memory model (CHARM). Ten series of computer simulations are presented. Analysis of CHARM and comparisons to other models indicate that the recognition-failure function depends on (a) both recognition and recall being similar (convolution-correlation) processes such that an interpretable representation is retrieved in both tasks and (b) the information underlying both recall and recognition being stored in the same composite memory trace. It is of considerable interest that constructs central to the distributed nature of CHARM are responsible for the model's adherence to the recognition-failure function.

Recognition failure of prose-embedded words.

The purpose of the present study was developed into 3 parts :(a) to replicate and extend the study by Nilsson et al.; (b)to explore a set of variables that is assumed to affect the degree of semantic as opposed to episodic involvement at retrieval and (c) to pit a retrieval independence view of recognition failure that is supposed to account for the results under standard procedure against a semantic, schema-based hypothesis (Jones 1983)under conditions both different from and similar to a standard procedure

Recognition failure of prose-embedded words.

Recognition failure of prose-embedded words.

視空間認知障害とリハビリテーション

視空間認知障害とリハビリテーション

Integration and cue overlap in recognition failure of recallable words

A highly systematic relation between the conditional probability of recognition given recall and the overall recognition hit rate has been demonstrated in a wide variety of experiments. A function describing this relationship was developed by Tulving & Wiseman (1975). Exceptions to this function have, in retrospect, been interpreted in terms of (a) a low integration between cue and target items, or (b) a high cue overlap between the two tests involved: recognition and recall. The experiment reported was designed to evaluate the joint and the separate contributions from integration and cue overlap for obtaining conformity with and exception from the Tulving‐Wiseman function. In line with the predictions made, the results showed that these two factors in combination can account for data that fit the function and for exceptions above the function. In relative terms, the contribution from integration was somewhat more pronounced than that from cue overlap.

Recognition failure when recognition targets and recall cues are identical

An experiment is reported in which the recognition and recall of target words were compared when recall was cued by other words that were either identical or not identical to the targets. Two types of nonidentical cue were used—semantic cues and associate cues (e.g., down and hope, respectively, for the target HIGH; in this case, the identical cue was, of course, high). The results are shown to have two principal implications. First, the results are consistent with the dual-route model of recall and, in particular, support earlier indications that direct and indirect routes to recall may be exclusive in operation. Second, they demonstrate that the empirical Tulving-Wiseman law that describes the relation between recognition and recall over a wide range of conditions does not hold for identical cues, thereby providing further confirmation of its established range of applicability.

The Recognition Failure and Graphic Success of Idiot‐Savant Artists

Three groups of subjects, an idiot-savant group, a group of mentally handicapped subjects matched for IQ, and normal artistically gifted children, were compared for their recognition and graphic reproduction abilities. It was found that, independent of input modality, level of intelligence determined recognition performance, while graphic ability independent of IQ was the determining factor in reproduction accuracy.

PRESERVED RECALL VERSUS IMPAIRED RECOGNITION:

A very pure and most unusual case of memory impairment is reported in a patient operated on for an aneurysm of the anterior communicating artery. Neuropsychological investigation performed about 8 yrs after the operation revealed a dissociation between very poor performance on recognition tests (on which the patient's performance was as poor as that in classical amnesic patients) and normal performance (estimated by the number of correct responses) in recall. This pattern has not previously been reported and is the reverse of that observed both in normal subjects and in amnesic patients. In addition, the patient was able to achieve a number of difficult learning tasks, at times normally; the relearning of one of these tasks after a delay of 1 h was perfectly normal. The recognition failure is interpreted in terms of the suggestion that memory performance results from an interaction between knowledge and subjective experience of remembering.