{'fraction_non_alphanumeric': 0.030276046304541407, 'fraction_numerical': 0.0, 'mean_word_length': 5.853658536585366, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Testing the Foundations of Signal Detection Theory in Recognition Memory

Signal Detection Theory (SDT) plays a central role in the characterization ofhuman judgments in a wide range of domains, most prominently in recognition memory. But despite its success, many of its fundamental properties are often misunderstood, especially when its comes to its testability. The present work examines five main properties that are characteristic of existing SDT models of recognition memory: i) random-scale representation, ii) latent-variable independence, iii) likelihood-ratio monotonicity, iv) ROC function asymmetry, and v) non-threshold representation. In each case, we establish testable consequences and test them against data collected in the appropriately-designed recognition memory experiment. We also discuss the connection between yes-no, forced-choice, and ranking judgments. This connection introduces additional behavioral constraints and yields an alternative method of reconstructing yes-no ROC functions. Overall, the reported results provide a strong empirical foundation for SDT modeling in recognition memory.