| Abstract: | Two experiments investigated how much time Ss take to verify a sentence with respect to a set of subject-verb-object (SVO) propositions they had learned. Three triplets of SVOs provided differing degrees of equivocation, including (1) unique SVOs, (2) a V with 3 SOs, and (3) an SV with 3 Os. A general class of models was proposed regarding the representation of prepositional trees in memory and an algorithm by which a probe tree might be verified against a set of trees in memory. In Expt I, verification times were least for Condition (1), slower and equal for Conditions (2) and (3). In Expt II, a fourth condition, an SO with 3 Vs, produced verification times as slow as those in Condition (3). Of several models considered, the closest-fitting one assumed parallel search processes proceeding simultaneously from S, V, and O positions of the probe, scanning through memory trees structered according to the HAM (Human Associative Memory) theory of Anderson and Bower. |
