Abstract

We propose that the intriguing bow effects in choice probabilities and response times that are found in unidimensional absolute identification might be a consequence of the mapping process required when a unidimensional psychological representation is mapped to a multidimensional response vector. This idea builds on previous work by Lacouture & Marley (1991) which modeled absolute identification using a connectionist feed-forward network. A formal solution of the so-called "encoder problem" is the basis of the approach, and the inclusion in the model of "noisy" mappings and integrators allows us to model both the responses made and the time to make them. The simulated model reproduces several of the phenomenon in unidimensional absolute identification including bow, range, and some sequential effects.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.