Lecture Notes in Computer Science Edited by G. Goos and J. Hartmanis
22 [[
Formal Aspects of Cognitive Processes Inter...
53 downloads
661 Views
14MB Size
Report
This content was uploaded by our users and we assume good faith they have the permission to share this book. If you own the copyright to this book and it is wrongfully on our website, we offer a simple DMCA procedure to remove your content from our site. Start by pressing the button below!
Report copyright / DMCA form
Lecture Notes in Computer Science Edited by G. Goos and J. Hartmanis
22 [[
Formal Aspects of Cognitive Processes Interdisciplinary Conference Ann Arbor, March 1972
Edited by Thomas Storer and David Winter
Springer-Verlag Berlin-Heidelberg • New York 1975
Editorial Board: P. Brinch Hansen. D. Gries C. Meter • G. Seegm011er • N. Wirth Dr. Thomas Storer Dr. David Winter The University of Michigan Department of Mathematics Ann Arbor, MI 48104/USA
Library of Congress Cataloging in Publication Data
Interdisciplinary Conference in the Formal Aspects of Cognitive Processes~ Ann Arbor, Mich., 1972. Formal aspects of cognitive processes. (Lecture notes in cc~iputer science ; 22) Includes index. i. Cognition--Congresses. I. Storer~ Thomas~ ed. ii. Wiinter~ David J., ed. !II. Title. IV. Series. BF311. !56 1973 001.53 74-32111 ISBN 0-387-07016-8
AMS Subject Classifications (1970): 68-02, 68A30, 6 8 A 3 5 , 68A45, 68A50, 68A55 CR Subject Classifications (1974): 3.6, 3.7 ISBN 3-540-07016-8 Springer-Verlag Berlin • Heidelberg • New York ISBN 0-387-07016-8 Springer-Verlag New Y o r k . Heidelberg. Berlin This work is subject to copyright. All rights are reserved, whether the whole or part of the material is concerned, specifically those of translation, reprinting, re-use of illustrations, broadcasting, reproduction by photocopying machine or similar means, and storage in data banks. Under § 54 of the German Copyright Law where copies are made for other than private use, a fee is payable to the publisher, the amount of the fee to be determined by agreement with the publisher. © by Springer-Verlag Berlin - Heidelberg 1975. Printed in Germany. Offsetdruck: Julius Beltz, Hemsbach/Bergstr.
PRE FACE The academic disciplines which have produced models of cognitive processes vary from psychology to sociology, linguistics, psyeholinguistics, mathematical biology, neurophysiology, communication sciences, mathematics and logic, each of which may embody s e v e r a l distinct and diverse subdiseiplines.
Further, the types of models involved range
from heuristic to empirical, pragmatic, programmatic, and (varying degrees of) formalistic with every combination of these also being represented. The "Interdisciplinary Conference in the F o r m a l Aspects of Cognitive P r o c e s s e s " , which was held in Ann Arbor, Michigan in March 1972, was primarily devoted to formal models of cognitive processes with particular emphasis on the explication of the assumptions and hypotheses underlying new and existing models and theories in the above areas.
As was
anticipated, the atmosphere and the talks presented at the conference stimulated a free flow of ideas among the participants which, it is hoped, has opened continuing channels of communication among investigators from the disciplines represented, thereby contributing to continuing studies in the a r e a of theoretical models of cognitive processes.
We a r e publish-
ing here a representative selection of the papers presented at the conference in further suppert of these studies. We take this opportunity to warmly thank those who helped us with the conference and these conference proceedings.
The conference was funded by the Institute of Science and
Technology at The University of Michigan. Zukowski.
Most of the organization work was done by Lee
The typing of the proceedings was done by Catherine Rader.
thank Springer Verlag for agreeing to publish the proceedings.
Thomas Storer, Buffalo and Ann Arbor David Winter, Ann Arbor November 1973
Finally, we wish to
TABLE OF CONTENTS
~LCO~
ABOARD
Thomas S t o r e r
................................................................
1
THEORIES OF THE BRAIN; 5F/~AVIOR, THE M]ZID, ROBOTS AND COGNITIVE PROCESSES, RESPECTIVELY John T. Lamendella ...........................................................
4
TWO CLASSES OF HOLOGRAPHIC PROCESSES EEALIZABIZ IN THE N E U I ~ REAI~ J: Patrick Cavanagh ..........................................................
14
SEMANTIC MEMORY RETFJEVAL: SOME DATA AND A MODEL Elizabeth F. Loftus ..........................................................
41
IMPLICATION AS AN A L T ~ T I V E TO SET-II~gLUSION AS THE SEMANTIC PP_IMiTIVE Arnold Lewis Glass ...........................................................
55
STRUCTUEED-S~ORAGE AFA (Abstract)Armen Gabrielian, Seymour Ginsburg ...........................................
70
PREDICATE C A L C ~ U S F E A T L ~ G F _ ~ T I O N David Rothenberg .............................................................. 72 A MATHEMATICAL MODEL FOR PERCEPTION APPLIED TO THE PERCEPTION OF PITCH David Rothenberg .............................................................. 126 MODELS OF SPEECH PRODUCTION Chin-W. Kim ................................................................... 142 TOWARDS A THEORY OF LINGUISTIC MEMORY Terrence J. Keeney ............................................................
159
THE G R ~ OF RELATIVE ADJECTIVES AND COMPARISON Renate Bartsch, ~ e o Verm~nann ................................................ 1 6 8 A SIMPLE HIERARCHICAL MODEL OF NATURAL SEIJZCTION David J. Winter ............................................................... 186 ON THE NOTION OF A RULE Thorns Olshewsky .............................................................. 1 8 9 EMPIRICAL RESTRICTIONS ON THE POWER OF TRANSFORMATIONAL GRAMMARS Royal Skousen ................................................................. 2 0 4
WELCOME ABOARD Thomas Storer T h e U n i v e r s i t y of M i c h i g a n W e l c o m e to the " I n t e r d i s c i p l i n a r y C o n f e r e n c e in the F o r m a l A s p e c t s of Cognitive Processes".
The w o r d " i n t e r d i s c i p l i n a r y " was put in the announced title in the advance
f l y e r , by the way, a s a hopeful e x p r e s s i o n of m y own p r e d i s p o s i t i o n t o w a r d s the c o n f e r e n c e participants.
Things w o r k e d out p r e t t y well in that r e g a r d , I think; the d i s c i p l i n e s r e p r e -
s e n t e d by o u r s p e a k e r s include c o m p u t e r and c o m m u n i c a t i o n s c i e n c e s , l i n g u i s t i c s , m a t h e m a t i c s , n e u r o p h y s i o l o g y , philosophy, psychology, s o c i a l r e s e a r c h , and s y s t e m s and i n d u s t r i a l e n g i n e e r i n g - - a n d the s u b d i s c i p l i n e s of e a c h of t h e s e h e r e r e p r e s e n t e d is equally v a r i e d . L e t m e s a y now t h a t the r e s p o n s i b i l i t y for the choice of the p a r t i c u l a r a r e a r e p r e s e n t a t i v e s for t h i s c o n f e r e n c e is e n t i r e l y m i n e - - t h e c o m m o n t h r e a d , o r " b o n d " , being only (as s u g gested) a n i n t e r e s t in cognitive p r o c e s s e s and a f o r m a l i s t i c a p p r o a c h . in t h a t r e g a r d a r e w a r r a n t e d a t t h i s t i m e .
P e r h a p s a few w o r d s
S p e a k e r s w e r e no__t.tc h o s e n on the b a s i s of r e p u -
tation o r a r e a but, r a t h e r , on the b a s i s of a d i s c i p l i n e d a p p r o a c h a s s e t f o r t h in t h e i r p r e liminary abstracts.
T h i s i s not to s a y that I n e c e s s a r i l y a g r e e with e i t h e r the p a r t i c u l a r
a p p r o a c h o r the c o n c l u s i o n s of any given s p e a k e r ; s i m p l y that e a c h h a s s o m e t h i n g i m p o r t a n t to be said within a f r a m e w o r k which allows for s o m e s o r t of f o r m a l s t a t e m e n t a n d / o r analysis.
And t h i s , I feel, could be p r o f i t a b l e for the whole c o m m u n i t y .
T h i s p a r t i c u l a r c o n f e r e n c e c a m e about in the following way: in the p a s t 2 - 1 / 2 y e a r s I have t r a v e l e d to s e v e r a l c o n f e r e n c e s in one o r m o r e of the a r e a s h e r e r e p r e s e n t e d - - s o m e t i m e s speaking, s o m e t i m e s only a t t e n d i n g - - a n d I found that s e v e r a l i n t e r e s t i n g o b s e r v a t i o n s w e r e s e e m i n g l y to be m a d e .
Among these are numbered:
1) T h e s e c o n f e r e n c e s w e r e s t a u n c h l y a n t i - f o r m a l i s t t e .
Most s p e a k e r s , g r a n t e d ,
b o r r o w e d f r e e l y f r o m the m o r e f o r m a l d i s c i p l i n e s , but often a b u s e d the language b o r r o w e d f r o m the p a r e n t d i s c i p l i n e with r e s p e c t to that d i s c i p l i n e .
Personal interchanges at these
m e e t i n g s left m e s o m e w h a t s k e p t i c a l a s to w h e t h e r o r not p r e c i s e t e r m s , u s e d i m p r e c i s e l y , w e r e being s u b s t i t u t e d f o r i m p r e c i s e t e r m s . 2) Unlike the m a t h e m a t i c s and logic c o n f e r e n c e s (the only o n e s of m y p r e v i o u s a c t i v e p a r t i c i p a t i o n ) the t a l k s w e r e often e x e r c i s e s in d e f e n s i v e n e s s ( p a r t i c u l a r l y of reputation) and developed into e m o t i o n a l i n v o l v e m e n t , s o m e t i m e s to the exclusion of p r o p o s e d content. 3) Often, at the v e r y u n i v e r s i t y which housed the c o n f e r e n c e , t h e r e w e r e people (who, it a p p e a r e d to m e , w e r e v e r y good, a n d not to be d i s m i s s e d lightly) who " n e v e r went to s u c h things" even though t h e r e w e r e in the a p p a r e n t m a i n s t r e a m of the d i s c i p l i n e in question, had s o m e t h i n g i m p o r t a n t and r e l e v a n t to say, and w e r e , quite obviously, v e r y i n t e r e s t e d in the
topics u n d e r d i s c u s s i o n .
T h o s e to whom I a m r e f e r r i n g felt t h a t the v e r y lack of a c o m m o n
f o r m a l g r o u n d w o r k w a s a b a r r i e r to p r o d u c t i v e d i s c u s s i o n s a n d r e s u l t s . 4) A d i s p r o p o r t i o n a t e l y s m a l l s e g m e n t of the r e s p e c t i v e c o m m u n i t i e s i n v o l v e d s e e m e d to m o n o p o l i z e the a d d r e s s e d . In view of t h e s e ( a d m i t t e d l y subjective) o b s e r v a t i o n s (on an a d m i t t e d l y s m a l l s a m p l e space), I r e s o l v e d to s o m e d a y t e s t t h e s e o b s e r v a t i o n s by o r g a n i z i n g a c o n f e r e n c e w h i c h 1) was of a f o r m a l i s t i c bent, 2) i n v i t e d s p e a k e r s without r e g a r d to r e p u t a t i o n , 3) a g g r e s s i v e l y a d v e r t i s e d to " t h o s e usually excluded f r o m such p r o c e e d i n g s " , and 4) excluded m o s t of the usual r u n of s p e a k e r s via 1), 2) and 3) above, and the i n j u n c tion t h a t the only thing a s p e a k e r m a y l e g i t i m a t e l y a s s u m e f r o m h i s a u d i e n c e is s o m e d e g r e e of f o r m a l s o p h i s t i c a t i o n . The U n i v e r s i t y of Michigan, u n d e r the a u s p i c e s of the D e p a r t m e n t of M a t h e m a t i c s , with the s p o n s o r s h i p of the I n s t i t u t e of Science and Technology has m a d e m y r e s o l u t i o n a reality at this time.
And t h i s c o n f e r e n c e was viewed as an e x p e r i m e n t - - a " t r i a l r u n " , a s i t
w e r e - - a n d the r e s p o n s e so f a r h a s b e e n e x t r e m e l y positive, a l m o s t o v e r w h e l m i n g .
I
(immodestly) a s c r i b e t h i s r e s p o n s e to the c o r r e c t n e s s of (at l e a s t s o m e of) m y o b s e r v a t i o n s c o n c e r n i n g the " u s u a l " c o n f e r e n c e of t h i s type, and t h a t t h e s e r e a c t i o n s a r e s h a r e d by s o m e s u b g r o u p of t h e b r o a d c o m m u n i t y . Now I, too (in conjunction with J o h n L a m e n d e l l a ) , h a v e a f o r m a l a p p r o a c h to cognitive p r o c e s s e s - - i e . , a m o d e l (which it is not m y p u r p o s e to d i s c u s s h e r e ) - - a n d have spoken about it s e v e r a l t i m e s to v a r i o u s c o n f e r e n c e s and " i n t e r e s t e d " g r o u p s .
U n f o r t u n a t e l y , it
s u f f e r s f r o m the defect of not p r o p e r l y belonging to any d i s c i p l i n e , p r e s u p p o s i n g s o m e n e u r o physiology, a little s e t t h e o r y , logic, g r a p h t h e o r y (damn little), and one t r i v i a l topological r e s u l t (which can be o m i t t e d if y o u ' l l take m y word that v a r i o u s s t r u c t u r e s w h i c h a r e i n t r o duced a r e well--defined)--all in all (with the e~ception of the n e u r o p h y s i o l o g y and the one "lifting t h e o r e m " f r o m topology) m a t e r i a l c o v e r e d in the f i r s t four weeks of our F r e s h m a n Honors Calculus c o u r s e .
The model a r o s e in conjunction with a n a t t e m p t to f o r m a l l y c h a r -
a c t e r i z e c e r t a i n l i n g u i s t i c p r o c e s s e s , but, r e c o g n i z i n g the g e n e r a l i t y of the t h e o r y , we couched it in the language of " g e n e r a l i z e d " cognitive p r o c e s s e s - - a s p e c i a l c a s e of which is the o r i g i n a l c h a r a c t e r i z a t i o n p r o c e s s u n d e r d i s c u s s i o n
L i n g u i s t i c j o u r n a l s say, "Too
f o r m a l ; b e s i d e s t h i s stuff is psychology. " Psychology j o u r n a l s devoted to cognitive p r o c e s s e s say, "Too f o r m a l ; b e s i d e s , t h i s stuff is m a t h e m a t i c s . " M a t h e m a t i c s j o u r n a l s say, "Too i n t e r d i s c i p l i n a r y ; and b e s i d e s , the m a t h e m a t i c s involved is t r i v i a l .
Write a book."
Some
of the f r u s t r a t i o n g e n e r a t e d by the above also s e r v e s a s p a r t i a l m o t i v e for t h i s c o n f e r e n c e .
T h i s c o n f e r e n c e i s , finally, a n a t t e m p t to obviate the above and s i m i l a r f r u s t r a t i o n s (which I know f o r a fact a r e not e x p e r i e n c e s unique to J o h n L a m e n d e l l a a n d myself) t h r o u g h the p r e s e n t a t i o n of a n i n t e r d i s c i p l i n a r y c o l l e c t i o n of p a p e r s devoted to the f o r m a l a s p e c t s of cognitive p r o c e s s e s a s a viable, valuable, p r o d u c t i v e d i s c i p l i n e in its own r i g h t .
The
~peakers h e r e a s s e m b l e d r e p r e s e n t m y choice for the s p o k e s m e n in s u p p o r t of t h i s viewpoint, and they will b e g i n p r e s e n t i n g the h a r d e v i d e n c e a t 1 P . M . t h i s a f t e r n o o n .
THEORIES OF THE BRAIN; BEHAVIOR, THE MIND, ROBOTS AND COGNITIVE PROCESSES, R E S P E C T I V E L Y J o h n T. L a m e n d e l l a San J o s e State College Many t r a n s f o r m a t i o n a l g r a m m a r i a n s have b e c o m e c o n v i n c e d t h a t the field of l i n g u i s t i c s i s , in r e a l i t y , a b r a n c h of cognitive psychology and t h a t a t r a n s f o r m a t i o n a l g r a m m a r should be viewed a s a cognitive t h e o r y of language.
T h i s position h a s led at l e a s t s o m e
l i n g u i s t s to w o n d e r how one m i g h t v a l i d a t e c l a i m s of cognitive r e l e v a n c e ; how one could c h o o s e between t h e o r i e s which equally well a c c o u n t e d for the e m p e r i c a l data but with d i f f e r e n t psychological i m p l i c a t i o n s .
Having a s k e d t h e s e q u e s t i o n s , l i n g u i s t s join the r a n k s of
p s y c h o l o g i s t s , p h y s i o l o g i s t s , p s y c h o - p h y s i o l o g i s t s , n e u r o - p s y c h o l o g i s t s , p h i l o s o p h e r s , and o t h e r s who a l s o do not know what they m e a n when they talk about cognitive p r o c e s s e s . In this p a p e r I will aLtempt to outline a f r a m e w o r k for d i s c u s s i n g q u e s t i o n s like " W h a t is a cognitive p r o c e s s ?" " W h a t would a f o r m a l t h e o r y of cognitive p r o c e s s e s be like ? " "What is the r e l a t i o n s h i p b e t w e e a t h e o r i e s of the b r a i n , t h e o r i e s of b e h a v i o r , t h e o r i e s of m e n t a l p r o c e s s e s , t h e o r i e s of r o b o t s , and t h e o r i e s of cognitive p r o c e s s e s ? "
The d i s t i n c t i o n s I m a k e
apply only to a n i d e a l i z e d w o r l d of s c i e n t i f i c i n q u i r y i n h a b i t e d by s t r a w m e n who c o n s t r u c t t h e o r i e s p u r e l y of one type r a t h e r than the m e s s y types of t h e o r i e s w h i c h have a way to t u r n ing up in the r e a l world.
W h a t I give h e r e should be t a k e n as a plea for the e s t a b l i s h m e n t of
a conceptual f r a m e w o r k in t e r m s of which we c a n u n d e r s t a n d what a g i v e n r e a l w o r l d t h e o r y is a t h e o r y of. The f i r s t c l a s s of t h e o r i e s I would like to d i s t i n g u i s h i n v o l v e s an a n a t o m i c a l and physiological d e s c r i p t i o n of the s t r u c t u r e s a n d p r o c e s s e s of the n e r v o u s s y s t e m .
The t h e o -
r e t i c a l c o m p o n e n t of such d e s c r i p t i o n s would for the m o s t p a r t be h y p o t h e s e s filling in the gaps of e m p i r i c a l o b s e r v a t i o n .
P h y s i c a l d e s c r i p t i o n t h e o r i e s would include d e f i n i t i o n s of
m o r p h o l o g i c a l u n i t s such a s the n e u r o n , s p i n a l c o r d , and the ~q c r a n i a l n e r v e .
In addition,
they would d e s c r i b e functional u n i t s such a s the a u d i t o r y pathways, the e x t r a - p y r a m i d a l m o t o r s y s t e m , and the t i m b i c s y s t e m .
The t e r m " f u n c t i o n a l " a s u s e d in t h i s c o n t e x t r e f l e c t s
a c o n c e r n with the s p a t i o - t e m p o r a l o r g a n i z a t i o n of a c t i v i t y in the a n a t o m i c a l u n i t s defined. The a u d i t o r y pathways a r e defined a s a " f u n c t i o n a l " e n t i t y on the b a s i s of s e q u e n c e d p a t t e r n s of n e u r a l a c t i v i t y t r a v e r s i n g s p e c i f i e d s t r u c t u r e s in the n e r v o u s s y s t e m o v e r t i m e .
F o r the
n e u r o p h y s i o l o g i s t , s t r u c t u r e and function a r e i n s e p a r a b l e a n d it would m a k e no s e n s e for the p h y s i o l o g i s t to talk of a u d i t o r y pathways a p a r t f r o m such s t r u c t u r e s a s the c o c h l e a r nuclei, m e d i a l geniculate body, etco
Hypothetical functional e n t i t i e s s u c h a s the s o d i u m pump i n -
volved in the conduction of the n e r v e i m p u l s e a r e p r o p e r l y p o s i t e d by the p h y s i o l o g i s t only
when they a r e c o n s t r u e d a s h a v i n g some r e a s o n a b l y d i r e c t p h y s i c a l r e a l i z a t i o n r a t h e r than m e r e l y being a way of looking at what h a p p e n s . The notion of functional
component
cognitive p r o c e s s e s i s quite d i f f e r e n t .
found in m a n y i n f o r m a t i o n p r o c e s s i n g m o d e l s of
T h u s , we m i g h t d i s c u s s a functional e n t i t y m o u s e t r a p
a p a r t f r o m any s p a t i o - t e m p o r a l p h y s i c a l m a n i f e s t a t i o n . it c a t c h e s m i c e .
Something i s a m o u s e t r a p p r o v i d e d
What p h y s i c a l f o r m it h a s is i r r e l e v a n t .
N e v e r t h e l e s s , it should be pointed
out t h a t while a p h y s i o l o g i s t ' s definition of function i n v o l v e s a p h y s i c a l m a n i f e s t a t i o n , p h y s i ological d e s c r i p t i o n s d o n ' t r e d u c e to a n a t o m i c a l s t r u c t u r e s in any s i m p l e m a n n e r .
T h u s , for
e x a m p l e , the a u d i t o r y pathways have no d i r e c t p h y s i c a l e x i s t e n c e a s a d i s t i n c t entity. The q u e s t i o n i s , could a physiological d e s c r i p t i o n of n e u r a l p r o c e s s e s count a s an explanation of cognitive p r o c e s s e s .
C e r t a i n l y some s c h o l a r s b e l i e v e it is only b e c a u s e we
d o n ' t know enough a b o u t the b r a i n t h a t we c a n n o t give adequate p h y s i o l o g i c a l a c c o u n t s of c o g nitive processes.
H o w e v e r , j u s t a s a p h y s i o l o g i c a l d e s c r i p t i o n r e d u c e s to an a n a t o m i c a l
d e s c r i p t i o n only in an oblique, a s yet f o r m a l l y undefined way, so a d e s c r i p t i o n of cognitive p r o c e s s e s r e d u c e s to physiological d e s c r i p t i o n in s o m e even m o r e oblique, even m o r e u n d e fined way. The c o n c e r n s of the i d e a l i z e d p s y c h o l o g i s t a r e quite d i f f e r e n t f r o m t h o s e of the i d e a l i z e d physiologist.
F o r e x a m p l e , while a physiological t h e o r y would be c o n c e r n e d with
the b i o c h e m i c a l a n d / o r s t r u c t u r a l m o d i f i c a t i o n s which u n d e r l i e m e m o r y s t o r a g e in the b r a i n , i t would not be c o n c e r n e d with the fact t h a t people s t o r e i n f o r m a t i o n about the w o r l d and u s e t h i s i n f o r m a t i o n in p a r t i c u l a r ways for p a r t i c u l a r r e a s o n s .
If r e v e r b e r a t i n g c i r c u i t s , f a c i l i -
t a t e d synaptie t r a n s m i s s i o n , n e t w o r k s t r u c t u r e s , p r o t e i n s y n t h e s i s , and glial p r o c e s s e s w e r e all involved in the s t o r a g e of i n f o r m a t i o n about the w o r l d , the p h y s i o l o g i s t , a s p h y s i o l o g i s t , would not notice.
T h e r e is no physiological b a s i s f o r identifying t h e s e d i v e r s e p h y s i c a l
s t r u c t u r e s a s functionally e q u i v a l e n t in the s e n s e in w h i c h they all function to s t o r e i n f o r m a tion.
T h i s i s the p~ychologist~s notion of function.
Even if a totally adequate d e s c r i p t i o n of
p h y s i o l o g i c a l p r o c e s s e s , e x i s t e d , a d e s c r i p t i o n of cognitive p r o c e s s e s would s t i l l have to be given by the field of psychology. A v e r y popular a p p r o a c h to the study of cognitive p r o c e s s e s within the r e a l w o r l d field of psychology h a s been to i g n o r e t h e m e n t i r e l y and d e s c r i b e i n s t e a d the e x t e r n a l b e h a v i o r w h i c h i s the r e s u l t of cognitive p r o c e s s e s . forms.
T h e o r i e s within t h i s a p p r o a c h can take s e v e r a l
E a r l y b e h a v i o r i s m and m u c h s o - c a l l e d n e o - b e h a v i o r i s m e x e m p l i f y a n a p p r o a c h I
will call b e h a v i o r i a l taxonomy.
Within this f r a m e w o r k , a d e s c r i p t i o n of a s p e c i f i e d domain
of h u m a n b e h a v i o r i n v o l v e s a s y s t e m of p r e d i c t i o n s of the a s s o c i a t i o n s a m o n g e x t e r n a l e v e n t s and s t a t e s ; i . e . ,
an i n v e n t o r y of s t i m u l u s - r e s p o n s e p a i r s .
The two m a j o r s o u r c e s of e v i -
dence for the c o n s t r u c t i o n of such t a x o n o m i e s a r e o b s e r v a t i o n of o v e r t b e h a v i o r in r e l a t i o n
to e x t e r n a l e v e n t s and e x p e r i m e n t a l l y d e r i v e d c o n c l u s i o n s about the c o r r e l a t i o n s between observed events. T h e s e t h e o r i e s a c c o u n t f o r i n t e r n a l p r o c e s s e s only in the s e n s e that the a s s o c i a t i o n between input s t i m u l i and output r e s p o n s e s of an o r g a n i s m a r e t a k e n to u l t i m a t e l y involve p r o c e s s e s in the n e r v o u s s y s t e m .
The t e r m cognitive p r o c e s s , often u s e d to show m e r e l y
that one i s not a n a i v e S-R b e h a v i o r i s t , h a s c o m e to be applied by naive S-R b e h a v i o r i s t s to things s u c h as c r e a t i v i t y , p e r s o n a l i t y , e m o t i o n , m o t i v a t i o n , and o t h e r p r e v i o u s l y u n m e n tionable topics.
The a t t e m p t h a s b e e n m a d e to " t h e o r e t i c a l l y " a c c o u n t for t h e s e p h e n o m e n a
solely in t e r m s of o v e r t b e h a v i o r without involving i n t e r n a l p r o c e s s e s and s t r u c t u r e s in any t h e o r e t i c a l l y r e l e v a n t way.
M o s t p s y c h o l o g i s t s have r e c o g n i z e d the f a i l u r e of t h e s e a t t e m p t s
and m a n y n e o - b e h a v i o r i s t s have s h i f t e d t h e i r t h e o r e t i c a l i n t e r e s t s beyond b e h a v i o r a l t a x o n o my.
Many n e o - b e h a v i o r a l a p p r o a c h e s now a t t e m p t to i n c o r p o r a t e c o v e r t i n t e r v e n i n g v a r i a b l e s
w h i c h m e d i a t e between e x t e r n a l s t i m u l i and r e s p o n s e s . B e f o r e d i s c u s s i n g the s t a t u s of t h e s e f o r m u l a t i o n s a s d e s c r i p t i o n s of cognitive p r o c e s s e s , it would p e r h a p s be helpful to c o n s i d e r a h i s t o r i c a l d e v e l o p m e n t in the field of l i n g u i s t i c s w h i c h b e g a n with a n o t h e r b r a n d of b e h a v i o r a l t a x o n o m y and a l s o ended with a c o n c e r n for d e s c r i b i n g c o v e r t s t r u c t u r e s , Although it bad no a s p i r a t i o n s of p s y c h o l o g i c a l r e l e v a n c e , s t r u c t u r a l i s m within the field of l i n g u i s t i c s adopted the m e t h o d o l o g i c a l s t r i c t u r e s of b e h a v i o r i s m and shunned a l l " m e n t a l i s m " in d e s c r i b i n g language b e h a v i o r .
The s t r u c t u r a l l i n g u i s t ' s m a i n c o n c e r n was
the d e v e l o p m e n t of a n a l y t i c a l t e c h n i q u e s w h i c h could be u s e d as d i s c o v e r y p r o c e d u r e s for o b j e c t i v e l y getting a t the s t r u c t u r e of language data. A p h r a s e s t r u c t u r e g r a m m a r d e s c r i b e s a language by a s s i g n i n g to e a c h s e n t e n c e in t h a t language a l a b e l e d b r a c k e t i n g w h i c h gives its s y n t a c t i c s t r u c t u r e . to be a s e t of s e n t e n c e s . pus of data.
The language is defined
F o r the s t r u c t u r a t i s t s , t h i s m e a n t the s e n t e n c e s found in t h e i r c o r -
During the 1950's in the field of l i n g u i s t i c s , t h e r e developed the r e a l i z a t i o n t h a t
j u d g m e n t s of native s p e a k e r s about the g r a m m a t i c a l i t y of s e n t e n c e s could p r o v i d e e v i d e n c e which was j u s t a s " e m p i r i c a l " and " s c i e n t i f i c " a s t h a t obtained by copying down w h a t e v e r native s p e a k e r s h a p p e n e d to say, taking t h e i r u t t e r a n c e s to be ipso facto g r a m m a t i c a l .
Per-
h a p s C h o m s k y ' s m o s t s i g n i f i c a n t c o n t r i b u t i o n to l i n g u i s t i c s w a s the r e i n t r o d u c t i o n of the notion t h a t n a t i v e s p e a k e r s m a k e m i s t a k e s and u t t e r u n g r a m m a t i c a l s e n t e n c e s . sigui£ieant in a t l e a s t two r e s p e c t s .
T h i s r e v e l a t i o n was
F i r s t , it led to a r e d e f i n i t i o n of what w a s a c c e p t a b l e data
for the l i n g u i s t m d a c o n c e r n f o r language s t r u c t u r e s which a r e n e v e r m a n i f e s t e d in o v e r t s p e e c h production.
Once the l i n g u i s t c o u l d n ' t r e l y on the n a t i v e s p e a k e r ' s s e n t e n c e production,
but i n s t e a d on what the n a t i v e s p e a k e r i n t u i t e d to be g r a m m a t i c a l , it was only a s h o r t step to a c o n c e r n f o r the n a t i v e s p e a k e r ' s i n t u i t i o n s about which s e n t e n c e s s e e m e d r e l a t e d and w h i c h
didn't.
F o r s e n t e n c e s such a s open the door, e m p i r i c a l e v i d e n c e could now be found for the
u n d e r s t o o d you w h i c h y o u r f o u r t h g r a d e E n g l i s h t e a c h e r told you was t h e r e .
This eventually
led to the d i s t i n c t i o n between s y n t a c t i c s u r f a c e s t r u c t u r e s a n d deep s t r u c t u r e s .
Secondly,
the e l i m i n a t i o n of m i s t a k e s f r o m the data and the addition of s e n t e n c e s w h i c h had n e v e r been u t t e r e d but whose g r a m m a t i c a l i t y the n a t i v e s p e a k e r would a f f i r m , led e v e n t u a l l y to the competence/performance distinction.
In i t s c u r r e n t f o r m the d i s t i n c t i o n s t a t e s that a t r a n s -
f o r m a t i o n a l g r a m m a r c h a r a c t e r i z e s the knowledge n a t i v e s p e a k e r s have of t h e i r language ( t h a t i s , l i n g u i s t i c c o m p e t e n c e ) r a t h e r t h a n the u s e to which t h i s knowledge i s put ( t h a t i s , linguistic p e r f o r m a n c e ) .
T h i s i s the p r i n c i p a l b a s i s for C h o m s k y ' s c l a i m t h a t l i n g u i s t i c s is
a b r a n c y of cognitive psychology. Should a t r a n s f o r m a t i o n a l g r a m m a r be c o n s t r u e d a s a t h e o r y of cognitive p r o c e s s e s b e c a u s e it p o s i t s a b s t r a c t s t r u c t u r e s which a r e n e v e r m a n i f e s t e d in o v e r t language b e h a v i o r ? Should n e o - b e h a v i o r i s t f o r m u l a t i o n s be c o n s i d e r e d to d e s c r i b e i n t e r n a l p r o c e s s e s b e c a u s e they p o s i t c o v e r t m e d i a t i n g r e s p o n s e s ? It is not by p u r p o s e h e r e to a r g u e q u e s t i o n s about p a r t i c u l a r t h e o r i e s , although m y b i a s e s should be c l e a r ,
W h a t I would like to do is c l a i m t h a t it i s f r u i t l e s s to d i s c u s s s u c h
q u e s t i o n s without s o m e g e n e r a l c o n c e p t u a l f r a m e w o r k w h i c h t e l l s one what kind of thing a cognitive p r o c e s s i s and, in a g e n e r a l fashion, what would c o n s t i t u t e a t h e o r y of such a thing. C o n s i d e r a type of theory, call it an a b s t r a c t c h a r a c t e r i z a t i o n t h e o r y , w h i c h i s still within the r e a l m of e m p i r i c a l d e s c r i p t i o n but goes beyond the b e h a v i o r a l t a x o n o m y a p p r o a c h . Such a theory, in addition to accounting for the s t r u c t u r e of o b s e r v e d b e h a v i o r , defines the i m p l i c i t r e l a t i o n s h i p s in the s t r u c t u r e of the data.
It c o n t a i n s a n e m p e r i c a l taxonomy t h e o r y
a s a c o m p o n e n t but u t i l i z e s o t h e r types of e v i d e n c e a s well.
In p a r t i c u l a r , it e m p l o y s e x p e r -
i m e n t a l e v i d e n c e b a s e d on intuitions and i n t r o s p e c t i o n s about the r e l a t i o n s h i p s holding b e tween the o v e r t s t r u c t u r e s .
By d e s c r i b i n g t h e s e data, i t m a y be said t h a t t h i s type of t h e o r y
c h a r a c t e r i z e s the f a c t s which a c c o u n t f o r the o v e r t f o r m of the data.
An a b s t r a c t s y n t a c t i c
s t r u c t u r e r u l e such a s " E v e r y s e n t e n c e c o n s i s t s of a noun p h r a s e followed by a v e r b p h r a s e " m a y c o r r e c t l y a s s e r t t h a t people p o s s e s s this bit of i n f o r m a t i o n a s p a r t ot t h e i r linguistic knowledge but in no way could this s t a t e m e n t be t a k e n to c o n s t i t u t e a d e s c r i p t i o n of t h i s k n o w ledge n o r of the way it i s i n t e g r a t e d into m e m o r y s t r u c t u r e s in e i t h e r a p h y s i o l o g i c a l o r psychological sense. We m i g h t c o m p a r e the types of t h e o r i e s d i s t i n g u i s h e d s o f a r in t e r m s of t h e i r t r e a t m e n t of the cognitive p r o c e s s e s u n d e r l y i n g h u m a n a r i t h m e t i c b e h a v i o r . F i r s t , the p h y s i o l o g i s t would have nothing s p e c i a l to s a y a b o u t the cognitive p r o c e s s e s involved when people add a n d s u b t r a c t u n l e s s , f o r e x a m p l e , t h e r e w e r e s p e c i a l i z e d c o r t i c a l n e u r o n s i n v o l v e d in the s t o r a g e and u t i l i z a t i o n of a r i t h m e t i c i n f o r m a t i o n .
While we m i g h t a g r e e that a b e h a v i o r a l taxonomy of a r i t h m e t i c b e h a v i o r c a t a l o g s i n t e r e s t i n g data, we would not be s a t i s f i e d that t h e s e data help explain the u n d e r l y i n g c o g n i tive p r o c e s s e s which w e r e r e s p o n s i b l e f o r the b e h a v i o r in question.
An a b s t r a c t c h a r a c t e r -
ization t h e o r y of a r i t h m e t i c knowledge a l r e a d y e x i s t s as a b r a n e y of n u m b e r t h e o r y and p o s i t s r u l e s such a s 1 + 1 = 2.
This t h e o r y not only d e s c r i b e s o v e r t human a r i t h m e t i c b e h a v i o r
( a f t e r e l i m i n a t i n g i r r e l e v a n t p e r f o r m a n c e v a r i a b l e s such as l a p s e s of attention, stupidity, etc. ) but c h a r a c t e r i z e s p e o p l e s ' knowledge of a r i t h m e t i c r e l a t i o n s h i p s . 10 + 2 = 7 + 5.
F o r e x a m p l e , that
It g e n e r a t e s an infinite s e t of a r i t h m e t i c e x p r e s s i o n s including novel e x p r e s -
sions which have n e v e r been produced.
While it is t r u e , in a s e n s e , that n u m b e r t h e o r y
a c c o u n t s for what people know about a r i t h m e t i c , no one i s t e m p t e d to say that it d e s c r i b e s a r i t h m e t i c knowledge in the mind and i s t h e r e f o r e a b r a n c h of cognitive psychology. An a b s t r a c t c h a r a c t e r i z a t i o n theory p o s i t s m a p s which r e l a t e f o r m a l o b j e c t s , but t h e r e a r e no p r o c e s s e s defined by the t h e o r y .
A transformational grammar describes a sen-
tence in p a r t by a s s i g n i n g it a set of syntactic p h r a s e m a r k e r s , r e l a t e d by a s e t of m a p s called t r a n s f o r m a t i o n s .
T h e r e i s no logical o r c h r o n o l o g i c a l o r d e r i n g between deep s t r u c -
ture t r e e s and s u r f a c e s t r u c t u r e t r e e s in a t r a n s f o r m a t i o n a l g r a m m a r ; t h e s e a r e s i m p l y two f o r m a l o b j e c t s which a r e p a r t of the s t r u c t u r a l d e s c r i p t i o n of the s e n t e n c e . c h a r a c t e r i z a t i o n t h e o r y also does not p o s i t any functional e n t i t i e s .
An a b s t r a c t
It i s s i m p l y a s y s t e m for
cataloging e m p i r i c a l data of both the o v e r t behavior type and the a b s t r a c t r e l a t i o n s h i p type. No p s y c h o l o g i c a l c l a i m s a r e made by such t h e o r i e s . The next c l a s s of t h e o r i e s to be d i s t i n g u i s h e d I wilt call functional d e s c r i p t i o n theories, t h e r e being at l e a s t t h r e e d i f f e r e n t l e v e l s of such t h e o r i e s which could be c o n s t r u e d as " m o d e l i n g " s o m e a s p e c t of the o r g a n i s m .
E a c h of t h e s e t h r e e subtypes of t h e o r y have d i f -
f e r e n t goals, a r e c o n s t r u c t e d on the b a s i s of d i f f e r e n t evidence~ and model the o r g a n i s m in a different sense.
The f i r s t c l a s s of t h e o r i e s , call it a b e h a v i o r a l i s o m o r p h i s m t h e o r y , c o n -
tains the o t h e r two; the second, call it a p.sychological i s o m o r p h i s m the or~, c o n t a i n s the third, what I will call a p s y c h o - p h y s i c a l i s o m o r p h i s m t h e o r y .
F i g u r e 1 s u m m a r i z e s the
t y p e s of t h e o r i e s p o s i t e d and t h e i r i n t e r r e l a t i o n s h i p s . ANATOMICAL DESCRIPTION
BEHAVIORAL TAXONOMY
PHYSIOLOGICAL DESCRIPTION
ABSTRACT CHARACTERIZATION BEHAVIORAL ISOMORPHISM PSYCHOLOGICAL ISOMORPHISM "~
>PSYCHOPHYSICAL ISOMORPHISM
Figure 1
It has been s u g g e s t e d that if one wanted to u n d e r s t a n d how a b i r d f l i e s , a good way to a p p r o a c h finding out would be to build one. a s a model of a bird.
However, not e v e r y t h i n g which can fly qualifies
At a m i n i m u m , the model would have to fly like a b i r d r a t h e r than a
jet plane or a h e l i c o p t e r .
In o r d e r to qualify a s a model of s o m e o r g a n i s m , the m i n i m a l c o n -
s t r a i n t on a t h e o r y m u s t be behavioral i s o m o r p h i s m within a s p e c i f i e d domain.
A model
w h o s e motive p o w e r was a r u b b e r band could qualify a s a b e h a v i o r i s o m o r p h i s m t h e o r y of a bird, fox" the domain "flying b e h a v i o r " , if the m o d e l flew the way a bird d o e s .
In o r d e r for
a c h e s s playing p r o g r a m to qualify a s a behavioral model of human c h e s s playing, it would have to show the s a m e p a t t e r n of developing skills, make an o c c a s i o n a l blunder and once in a while allow an opponent to r e t r a c t r e a l l y dumb m o v e s .
A b e h a v i o r a l i s o m o r p h i s m t h e o r y of
a b i r d would not have to have f e a t h e r s and be a biological o r g a n i s m , but h o w e v e r the b e h a v i o r was g e n e r a t e d , it would have to be i s o m o r p h i s with what a b i r d d o e s .
Notice, of c o u r s e , that
it is the g e n e r a t i o n or definition of the b e h a v i o r which i s at i s s u e r a t h e r than the production of the behavior.
A running c o m p u t e r p r o g r a m which p r o d u c e s b e h a v i o r may be f l a s h i e r than
the s a m e p r o g r a m w r i t t e n on a piece of p a p e r , but it i s the s a m e t h e o r y in e i t h e r c a s e . A b e h a v i o r a l i s o m o r p h i s m t h e o r y b e a r s a s p e c i a l r e l a t i o n s h i p to a b e h a v i o r a l taxonomy t h e o r y for the domain of definition in that the f o r m e r would i n c o r p o r a t e the l a t t e r by including in its r e p e t o i r e of b e h a v i o r all of the e m p i r i c a l data about the b e h a v i o r of the o r g a n i s m and i t s r e s p o n s e s to s t i m u l i . isomorphism theory.
This is r e a l l y the only c o n s t r a i n t on a b e h a v i o r a l
The i n t e r n a l p r o c e s s e s of the model could be d e v e l o p e d by p r a g m a t i c
t r i a l and e r r o r and it w o u l d n ' t m a t t e r what f o r m they took.
It m a k e s no s e n s e to a s k what
kind of evidence would v e r i f y the a p t n e s s of its i n t e r n a l s t r u c t u r e .
The only r e l e v a n t q u e s -
tion to be a s k e d is: Does it define the behavior of the o r g a n i s m in q u e s t i o n ? A b e h a v i o r a l taxonomy of a r i t h m e t i c b e h a v i o r would s i m p l y c o n s i s t of a l i s t of a s s o c i a t i o n s Of the s o r t : When Ss a r e p r e s e n t e d with the s t i m u l u s "How m u c h i s one and one?", the r e s p o n s e " t w o " i s e l i c i t e d with a . 83 probability.
Given this u n d e r s t a n d i n g of the
o v e r t behavior, the behavioral i s o m o r p h i s m t h e o r i s t would have the task of c o n s t r u c t i n g an automaton which would " b e h a v e " in e x a c t l y this way.
Such m o d e l s a l r e a d y e x i s t .
An adding
m a c h i n e i s a f a i r l y good b e h a v i o r a l i s o m o r p h i s m t h e o r y of human a r i t h m e t i c b e h a v i o r , e x cept i n s o f a r a s it f a i l s to make the r i g h t s o r t s of m i s t a k e s . What d i s t i n g u i s h e s a behavioral i s o m o r p h i s m t h e o r y f r o m a b e h a v i o r a l taxonomy is that the f o r m e r is an automaton containing a s e t of d e v i c e s e a c h of which e m b o d i e s one o r m o r e of the functions which account f o r e i t h e r the g e n e r a t i o n o r production of the d e s i r e d behavior.
Its functional e n t i t i e s a r e things like input d e v i c e , output device, m a t c h i n g p r o c -
e s s , m e m o r y s t o r a g e d e v i c e , etc.
In a b e h a v i o r a l i s o m o r p h i s m t h e o r y t h e r e a r e p r o c e s s e s
defined which a r e c h r o n o l o g i c a l l y o r d e r e d .
No one could build a r o b o t using only the i n f o r -
10 marion in a 0ehavioral taxonomy, has mathematical
but a behavioral isomorphism
or mechanical
theory is a robot whether it
form.
I doubt that any one would want to claim that the structures and processes behavioral isomorphism
theory of man
would constitute a theory of human
of a
cognitive processes,
although there are clearly people who would be content with this type of theory. Turing test, apart from missing the point of the controversy thesizes just such a behavioral isomorphism A concern for such models
The famous
about thinking, implicitly hypo-
model of man.
is a valid pursuit in its own right, but the cognitive
psychologist is interested only in a subset of the behavioral isomorphism
theories.
This
subset is defined by several further constraints which establish the class of psychological isomorphism
theories.
The functional components
which will generate the desired behavior, ally involved when people perform
processes
but are equivalent to the functions which are actu-
the behavior.
the model are interrelated in the same
of this type of theory are not just any set
Additionally,
the functional components
way the functional components
of people's cognitive
are actually related.
These theories incorporated
the insights and data from an abstract characterization
theory as well as a behavioral isomorphism people's knowledge description,
theory.
If, for example,
it were true that
of the syntactic structure of sentences involved two levels of grammatical
a psychological
isomorphism
theory of language might contain a functor which
changed a deep syntactic structure into a surface syntactic structure. that two robots, one constructed as only behaviorally isomorphic psychologically examine
isomorphic
to man
Notice, of course, and the other as
would be indistinguishable to an observer who was not free to
their internals workings. Many
of the psychological
have been computer
isomorphism
simulation models.
models which have been attempted thus far
For example,
the General Problem
Shaw and Simon attempts to simulate aspects of certain types of human also exemplifies the use of an additional type of evidence characteristic morphism
models.
Namely,
subject protocols of the thinking-out-loud
data which has only recently (again) become
respectable in psychology.
this type of data is information about the conscious mental experiences in some
of
cognitive process.
awareness
would,
Aspects of problem
of course,
always be taken at face value. report that he solves complex
Solver of Newell,
problem
of psychological
GPS iso-
variety, a type of What is gained from of someone
engaged
solving which are not available to conscious
not be derivable from protocol data and this sort of data cannot For example, problems
someone
with trick mathematical
by visualizing the problem
and then letting a piece of chalk write down the answer.
We
abilities might
on a mental blackboard
would consider the matter care-
fully before we build a blackboard and an animate piece of chalk into our model
problem solving.
solving.
of human
11 P s y c h o l o g i c a l i s o m o r p h i s m t h e o r i e s also c o n s t r u c t functional i n t e r p r e t a t i o n s of e x p e r i m e n t a l l y d e r i v e d c o n c l u s i o n s about c o v e r t s t a t e s and e v e n t s c a u s a l l y a f f e c t i n g b e h a v i o r in o r d e r to c o n s t r u c t i t s a c c o u n t of cognitive p r o c e s s e s .
In c o n s i d e r i n g v i s u a l i n f o r m a t i o n
p r o c e s s i n g , it s e e m s r e a s o n a b l e to conclude t h a t in o r d e r to get b i n o c u l a r d e p t h c u e s , the input f r o m one v i s u a l c h a n n e l m u s t be c o m p a r e d with the input f r o m the o t h e r channel.
Thus,
the psychological i s o m o r p h i s m t h e o r i s t m i g h t p o s i t the e x i s t e n c e of a single B i n o c u l a r C o m p a r i s o n C o m p o n e n t which o p e r a t e s to e x t r a c t t h e s e b i n o c u l a r c u e s on the b a s i s of input f r o m the left v i s u a l field a n d the r i g h t v i s u a l field.
Of c o u r s e , the p u r e p s y c h o l o g i c a l i s o m o r p h i s m
t h e o r i s t ig~aores physiological data so he would not be a w a r e o r c a r e how c o m p l e x the a c t u a l situation is; n o r would he find out t h a t his model i s not functionally e q u i v a l e n t to h u m a n v i s ual i n f o r m a t i o n p r o c e s s i n g beyond the b e h a v i o r a l i s o m o r p h i s m type of functional e q u i v a l e n c e . A r e a l l y p u r e psychological i s o m o r p h i s m t h e o r i s t m i g h t not even have noticed that m a n h a s two e y e s .
Of c o u r s e , it would be r e d i c u l o u s to c o n s i d e r v i s u a l p e r c e p t i o n without taking into
a c c o u n t a l l of the a v a i l a b l e physiological data.
No one would do s u c h a thing and e x p e c t h i s
model to a c t u a l l y d e s c r i b e h u m a n v i s u a l i n f o r m a t i o n p r o c e s s i n g .
One w o n d e r s , h o w e v e r ,
what t h e r e is about such t h i n g s a s p r o b l e m solving and language w h i c h allows " m a t e r i a l i s t " s c h o l a r s to feel c o m f o r t a b l e with m o d e l s of t h e s e p r o c e s s e s h a v i n g no b a s i s in p h y s i o l o g i c a l fact. Some people m i g h t b e t e m p t e d to define cognitive psychology such t h a t low l e v e l r e c e p t o r functions a r e viewed a s b e i n g m e r e l y physiological w i t h no r e l e v a n c e to the p s y c h o logist.
However, a t what point in the m e r e l y physiological v i s u a l pathways do cognitive p r o c -
e s s e s kick i n ?
Does v i s u a l i n f o r m a t i o n p r o c e s s i n g b e c o m e cognitive only a f t e r it h a s l e f t t h e
v i s u a l a r e a s of the c o r t e x and gone off into the m y s t e r i o u s " a s s o c i a t i o n a r e a s " w h e r e m e n t a l p r o c e s s e s a r e r e p u t e d to l u r k ?
U n l e s s we want to u s e the t e r m cognitive p r o c e s s a s a s y n -
onym for " c o n s c i o u s m e n t a l e x p e r i e n c e " , t h e r e i s no notion of " h i g h e r m e n t a l p r o c e s s " such t h a t we c a n functionally m o d e l v i s u a l cognition while i g n o r i n g the n e u r o p h y s i o l o g y of vision. P s y c h o l o g i c a l i s o m o r p h i s m t h e o r i e s a r e the f i r s t type of t h e o r y we have c o n s i d e r e d which in any s e n s e d e s e r v e s the l a b e l p s y c h o l o g i c a l and one w h i c h m i g h t r e a s o n a b l y be viewed a s telling us s o m e t h i n g about cognitive p r o c e s s e s .
Still, not e v e r y o n e would be s a t i s f i e d that
the i n t e r n a l p r o c e s s e s u n d e r y l i n g m a n ' s b e h a v i o r had been fully explained.
One p r o b l e m is
t h a t the i n t e r n a l s t r u c t u r e of the functional c o m p o n e n t s of a p s y c h o l o g i c a l i s o m o r p h i s m t h e o r y have no c o n s t r a i n t s o t h e r than t h e i r c a p a c i t y for p e r f o r m i n g the function.
Even if the
t h e o r y h a s one c o m p o n e n t c o r r e s p o n d i n g to e v e r y one p s y c h o l o g i c a l c o m p o n e n t ( a s s u m i n g a o n e - t o - o n e i s o m o r p h i s m w e r e d e s i r e d ) , the i n t e r n a l o p e r a t i o n s of the c o m p o n e n t s could n o t hope to r e f l e c t the way people p r o c e s s i n f o r m a t i o n while i g n o r i n g the physiological f a c t s entirely.
12 A m a j o r r e a s o n people a r e willing to a c c e p t m o d e l s of such things a s p r o b l e m solying w h i c h i g n o r e the b r a i n h a s to do with a r e a l w o r l d p r o b l e m for r e a l w o r l d i n v e s t i g a tors that doesn't trouble idealized, imaginary scholars.
It i s c l e a r that a cognitive p r o c e s s
s u c h a s p r o b l e m solving is i n t i m a t e l y tied up to v e r y m a n y o t h e r cognitive p r o c e s s e s .
An
explanation of the s t r u c t u r e of i n f o r m a t i o n in m e m o r y , the f o r m of i n c o m i n g p e r c e p t u a l data the l i m i t a t i o n s of s h o r t - t e r m m e m o r y , l e a r n i n g , m o t i v a t i o n , language, and a l m o s t e v e r y thing e l s e would be r e q u i r e d b e f o r e anyone could m a k e a n y r e a s o n a b l e c l a i m s about how h u m a n b e i n g s a c t u a l l y solve p r o b l e m s .
All of t h e s e p r o c e s s e s , in t h e i r t u r n , a r e i n t e r -
twined with p r o b l e m solving and the r e s t . The m o s t c o m m o n solution to t h i s p r o b l e m h a s been to a t t a c k only a s m a l l p a r t of one of the cognitive p r o c e s s e s and beg t h e r e s t .
T h i s i s c a l l e d m a k i n g " s i m p l i f y i n g assumptions'~
U s u a l l y the s m a l l p a r t which i s c h o s e n to be e x p l a i n e d i s the data f r o m a p a r t i c u l a r e x p e r i ment.
One finds an a r t i c l e e n t i t l e d s o m e t h i n g like, "A f o r m a l model of the s t r u c t u r e of
linguistic c o n c e p t s " w h i c h t u r n s out to be a c o m p u t e r s i m u l a t i o n t h e o r y w h i c h a c c o u n t s for the l e a r n i n g of six p a i r s of t h r e e - l e t t e r n o n s e n s e s y l l a b l e s u n d e r s p e c i f i e d c o n d i t i o n s of p r e s e n t a t i o n and r e h e a r s a l by five m a l e E n g l i s h - s p e a k i n g college s o p h o m o r e s f r o m M i d d t e b u r y , Connecticut.
If a n o t h e r i n v e s t i g a t o r c o m e s along and v a r i e s one of the p a r a m e t e r s ,
one
thing leads to a n o t h e r and a new ~ b f i e l d of psychology is b o r n . An additional r e a s o n for t h i s o v e r - s p e c i a l i z e d t r e a t m e n t i s the d e s i r e to avoid c l a i m s which do not a r i s e d i r e c t l y f r o m e x p e r i m e n t a l r e s u l t s in the s t a n d a r d f o r m a t .
Since the
m o d e l s developed a m o u n t to a s u m m a r y of p a r t i c u l a r data, t h e i r a p p l i c a b i l i t y always depends on the p a r t i c u l a r way the p r o b l e m was p r e s e n t e d to the s u b j e c t s , the a m o u n t and type of r e h e a r s a l , b a c k g r o u n d s of the s u b j e c t s , and so on.
T h e r e i s an e x c e l l e n t c h a n c e t h a t cognitive
psychology, a s b e h a v i o r a l psychology b e f o r e it, wilt end up c o n s i s t i n g of an u n s t r u c t u r e d heap of s u p e r f i c i a l , u n r e l a t a b l e e x p e r i m e n t a l data.
It does not s e e m r e a s o n a b l e to allow t h i s
type of s c i e n t i f i c i n v e s t i g a t i o n to continue to be the d o m i n a n t a c t i v i t y in the field of psychology. If psychology is e v e r going to get off the ground, s o m e way m u s t be found to i n c o r p o r a t e data into a g e n e r a l f r a m e w o r k w h e r e it c a n i n t e r a c t with a t t the o t h e r data being g a t h e r e d .
One
way to begin to tie t o g e t h e r the data which h a s been g a t h e r e d is to b r o a d e n the scope of the m a i n s t r e a m of psychology to include physiological facts. One m a y d e c i d e a s a m a t t e r of p r a c t i c a l fact t h a t it is u n r e a s o n a b l e to go beyond the p s y c h o l o g i c a l i s o m o r p h i s m l e v e l in d e s c r i b i n g cognitive p r o c e s s e s o r that one d o e s n ' t c a r e to t r y .
N e v e r t h e l e s s , it is not u n r e a s o n a b l e for s o m e o n e to w i s h for an e x p l a n a t i o n of c o g n i -
tive p r o c e s s e s which did explain exactly how h u m a n b e i n g s p e r f o r m t h e s e functional o p e r a tions.
A type of t h e o r y which would fully explain h u m a n cognitive p r o c e s s e s is the t h e o r y I
have called psycho-physical
isomorphism.
This theory contains the insights of physical
~3 description theories and psychological isomorphism theories. It presents an explicit answer to the question of the relationship between the mind and the brain. It explains how neurophysiological processes in human beings embody psychological functions. The development of such a theory is, in my opinion, the prime goal of cognitive psychology. Some psychologists might be tempted to avoid a psycho-physical orientation on the grounds that neurophysiology has not progressed far enough to say anything of significance about cog,aitive processes. I seriously doubt that this is true. There is an enormous amount of relevant information about the brain and its functioning. Even if one constructed a psychophysical theory on the basis of physiological data which turned out to be wrong, the theory would be e loser to an adequate theory than one which ignores the physiological data entirely. Neural net theories can be constructed at a level of generality which leaves them almost c e r tain to be correct models of information processing in the brain.
Further specificity could
a w a i t f u r t h e r data. Some p h y s i o l o g i s t s m i g h t be t e m p t e d to avoid a p s y c h o - p h y s i c a l o r i e n t a t i o n on the grounds that psychology h a s not p r o g r e s s e d f a r enough to s a y a n y t h i n g of s i g n i f i c a n c e about cognitive p r o c e s s e s .
However, the b e h a v i o r i s t s have a m a s s e d a prodigious q u a n t i t y of data
and o v e r the p a s t few y e a r s i n f o r m a t i o n p r o c e s s i n g m o d e l s have begun to develop v e r y i m p r e s s i v e c o m p u t e r s i m u l a t i o n s of a s p e c t s of cognitive p r o c e s s e s . The b e s t thing w h i c h could happen to both fields would be the d e v e l o p m e n t of a s t r o n g e r i n t e r e s t in p s y c h o - p h y s i c a l i s o m o r p h i s m t h e o r i e s .
The b e s t thing w h i c h could happen to a n
individual i n v e s t i g a t o r would be to have a c l e a r idea of what he is r e a l l y i n t e r e s t e d in e x p l a i n ing: the b r a i n , b e h a v i o r , the mind, r o b o t s , o r c o g n i t i v e p r o c e s s e s .
He should know w h e t h e r
the data he h a s u s e d is the kind of e v i d e n c e w h i c h l e a d s to m o d e l s of the s o r t he i s i n t e r e s t e d in.
And finally, he should c a r e f u l l y e x a m i n e his c o m p l e t e model to s e e what he h a s modeled.
TWO CLASSES OF HOLOGRAPHIC PROCESSES R E A L I Z A B L E IN THE NEURAL R E A L M J. P a t r i c k C a v a n a g h Carnegie-Mellon University Holography r e f e r s to a b r o a d c l a s s of s t o r a g e and r e t r e i v a l p r o c e s s e s b a s e d on the r e c o r d i n g of i n t e r f e r e n c e p a t t e r n s .
As a m o d e l for a n e u r a l m e m o r y s y s t e m , holography
p r o v i d e s both a s s o c i a t i v e and r e d u n d a n t s t o r a g e along with a m a t h e m a t i c a l l y e x p l i c i t d e s c r i p t i o n of the s y s t e m ' s o p e r a t i o n .
L a s h l e y (1929) w a s a m o n g the f i r s t to p r o p o s e t h a t
m e m o r y was coded in t e r m s of n e u r a l i n t e r f e r e n c e p a t t e r n s and was let to this c o n c l u s i o n by his d i s c o v e r y of r e d u n d a n t s t o r a g e in the b r a i n .
T w e n t y - s e v e n y e a r s l a t e r , B e u r l e (1956)
showed how s u c h i n t e r f e r e n c e p a t t e r n s m i g h t be s t o r e d so that the o r i g i n a l i n f o r m a t i o n could be r e t r i e v e d without d i s t o r t i o n .
In 1963, van H e e r d e n noted the s i m i l a r i t y between B c u r l e ' s
h y p o t h e s i s and the m o r e c o n c i s e r e p r e s e n t a t i o n of the i n t e r f e r e n c e p r o c e s s o f f e r e d by h o l o graphic theory.
Subsequently, a n u m b e r of a u t h o r s have outlined, to v a r y i n g d e g r e e s , the
analogy between h o l o g r a p h i c and n e u r a l p r o c e s s e s ( J u l e s z and P e n n i n g t o n , 1965; P r i b r a m , 1966, 1969, 1971; W e s t l a k e , 1967, 196o, 1970).
Of t h e s e , only W e s t l a k e (196~, 1 9 7 0 ) h a s
given a d e t a i l e d a n a l y s i s of the n e u r a l m e c h a n i s m s involved.
His h y p o t h e s i s , h o w e v e r , like
B e u r l e ' s , p l a c e s s e v e r e r e s t r i c t i o n s on the f i r i n g p a t t e r n s of n e u r o n s that a r e at odds with the known p r o p e r t i e s of n e u r a l codes. T h i s p a p e r will d e m o n s t r a t e t h a t h o l o g r a p h i c s t o r a g e c a n be o b t a i n e d when only the most general neural codes are assumed.
A recognition system employing transmission
holography is p r o p o s e d and the l i m i t e d c a p a c i t y of this type of s t o r a g e for multiple r e c o r d l a g s leads n a t u r a l l y to a m o d e l l i n g of s h o r t t e r m m e m o r y .
The s y s t e m p r e d i c t s a wide
r a n g e of b e h a v i o r a l data in r e c o g n i t i o n t a s k s b a s e d on a single a s s u m p t i o n c o n c e r n i n g the p r o p e r t i e s of individual n e u r o n s . B e f o r e d e t a i l i n g the n e u r a l h o l o g r a p h i c p r o c e s s e s , a b r i e f d e s c r i p t i o n of optical holography will d e m o n s t r a t e s o m e of the p r o p e r t i e s of this m e t h o d of s t o r a g e . Optical H o l o g r a p h y Optical holography, developed by G a b o r (1945), a l l o w s the r e c o r d i n g of both the p h a s e and a m p l i t u d e of a w a v e f r o n t of light.
Since p h o t o g r a p h i c p l a t e s a r e s e n s i t i v e to i n -
t e n s i t y but not to phase, the plate is exposed to two w a v e f r o n t s s i m u l t a n e o u s l y and the r e s u l t i n g i n t e r f e r e n c e p a t t e r n is r e c o r d e d .
If both w a v e f r o n t s a r e m o n o c h r o m a t i c and c o -
h e r e n t in phase, a s t a b l e i n t e r a c t i o n o c c u r s so t h a t the i n t e r f e r e n c e p a t t e r n codes both a m p l i t u d e and phase in t e r m s of i n t e n s i t y v a r i a t i o n s .
The r e c o r d e d i n t e r f e r e n c e p a t t e r n i s
the h o l o g r a m ; i l l u m i n a t i n g the h o l o g r a m with one of the o r i g i n a l w a v e f r o a t s c a u s e s the
15
r e c o n s t r u c t i o n of the o t h e r .
The h o l o g r a m is thus an a s s o c i a t i v e m e m o r y of the two w a v e -
fronts. If one of the original w a v e f r o n t s w a s the light r e f l e c t e d f r o m a t h r e e - d i m e n s i o n a l object, for e x a m p l e , the r e c o n s t r u c t i o n will be an e x a c t r e p l i c a of the o b j e c t such that no visual t e s t can d i f f e r e n t i a t e the two.
In o t h e r w o r d s , all of the phase and amplitude i n f o r -
mation has been r e c o v e r e d . F i g u r e i i l l u s t r a t e s the two s t e p s in the h o l o g r a p h i c p r o c e s s ,
a and b a r e w a v e -
f r o n t s that v a r y spatially in amplitude and phase, and A and. D a r e t h e i r t r a n s f o r m s at the photographic plate.
The photographic plate is s e n s i t i v e to r e c o r d i n g e n e r g y , i . e . the produci
RECORDING
b(x,y)
- b(x,y) e
i@(x,y)
A(u,v) • B(u,v)
photographic plate
RECONSTRUCTION __.b(X,y)
)gram
~(x,y) FIGURE i: OPTICAL HOLOGRAPHY
16
of the r e c o r d i n g i n t e n s i t y and the e x p o s u r e d u r a t i o n . E = t(A + B)(A + B)
(i)
A_, B__ - wavefront field vectors E - exposure energy t - exposure duration * - denotes complex conjugate After developing, energy;
the transmission
coefficient of the plate is a function of the exposure
if the function is linear, the resulting expression
is
T = BE = ~t(i A I2 + IB__[2 + A B * + A * + B )
(2) T - transmission coefficient ]3 - slope of transmission vs. exposure
relation If one of the original wavefronts
_~ or more
A__, is incident on the hologram,
the transmitted
A. T :
its transform
components
in the hologram
plane,
are
Ajt(IAI2+IBt2)+ tAAJ'% IA_[2B_
The first term describes the second represents plete reconstruction
precisely,
the transmission
a complex
of the a_ wavefront
wavefront
of the b wavefront
dependent
at an attenuated amplitude;
on both a and b; the third is a com-
attenuated by a real-valued
variable that can be con-
sidered constant if a and b are independent.
Under appropriate different directions
recording
geometries,
so that the reconstruction
the transmitted
components
propagate
of b is available uncontaminated
in
by the other
wavefrontso The hologram
is an associative
memory
in that storage of a and b allows recon-
struction of b_ upon reference
by a and vice versa.
(under certain transformation
between
part of the hologram
can reconstruct
The essential requirement are monochromatic
in the neural realm, interaction.
These
the first requirement
that code object information
properties
allow the wavefronts
is therefore to determine (1965) have assumed,
not only places unattainably
is that they to interfere
the possibility of holographic
of neural spike trains are all of a single frequency
This assumption
field) in that any
wavefront.
In demonstrating
Both Beurle (1956) and Wesflake
that wavefronts phase.
the complete
of the wavefronts
pattern.
or distributed memory
the object field and the recording
and phase coherent.
in a stable spatio-temporal
It is a redundant
the locus of the stable as in the optical case, and fixed in their relative
stringent requirements
of neural firing, but also is invalidated by the wide use of frequency stimulus attributes (e. g,, intensity, el. Perkel and Bullock,
1966).
storage
on the stability
in the brain for coding of
17 M o r e o v e r , such an a s s u m p t i o n is u n n e c e s s a r y in the d i s c r e t e n e u r a l s y s t e m a s opposed to the continuous optical c a s e ; the s t r u c t u r a l c o h e r e n c e i n h e r e n t in the fixed i n t e r n e u r a l c o n n e c t i o n s of the b r a i n a l r e a d y p e r m i t a s t a b l e s p a t i a l i n t e r a c t i o n of w a v e f r o n t s r e g a r d l e s s of the f r e q u e n c y a n d p h a s e of individual spike t r a i n s .
Since the i n t e r a c t i o n will
however, v e r y r a n d o m l y in t i m e ( a s s u m i n g r a n d o m v a r i a t i o n in i n t e r s p i k e i n t e r v a l s ) , it m u s t be shown that the m e a n spike r a t e i s the d o m i n a n t p a r a m e t e r in coding and s t o r a g e .
If this
is the c a s e , s p a t i o - t e m p o r a l s t a b i l i t y i s a c h i e v e d and the m a i n t e n a n c e of p r e c i s e spike a r r i v a l t i m e s , such as p r o v i d e d by f r e q u e n c y and p h a s e locked spike t r a i n s , is not r e q u i r e d . At p r e s e n t , t h e r e is a good deal of e v i d e n c e s u p p o r t i n g m e a n r a t e codes in v a r i o u s n e u r a l s t r u c t u r e s ( P e r k e l and Bullock, 196~).
The next s e c t i o n d e a l s with the n e u r a l h o l o g r a p h i c
p r o c e s s e s that a r e p o s s i b l e u s i n g such c o d e s . N e u r a l Holographic P r o c e s s e s L i n e a r Codes Since i n c o m i n g spike t r a i n s a r e m o s t likely of v a r y i n g f r e q u e n c i e s with s o m e c o m p o n e n t of r a n d o m fluctuation in each, it i s i m p r o b a b l e that a s t a b l e t e m p o r a l i n t e r a c t i o n can be a c h i e v e d at the level of individual spike a r r i v a l s .
The i n t e r f e r e n c e p a t t e r n m u s t
t h e r e f o r e be defined in t e r m s of s o m e t i m e - - a v e r a g e d p a r a m e t e r .
Mean r a t e , the a v e r a g e
spike a r r i v a l r a t e within s o m e t i m e i n t e r v a l , a p p e a r s to s e r v e the r e q u i r e d p u r p o s e .
The
f i r s t i m p o r t a n t a t t r i b u t e of the m e a n r a t e d e s c r i p t i o n of n e u r a l a c t i v i t y is t h a t a n e u r o n is a r e l a t i v e l y l i n e a r t r a n s d u c e r of t h i s p a r a m e t e r for i r r e g u l a r (Poisson) e x c i t a t o r y or i n h i b i t o r y input ( E n g e r , e t a l . ,
1969; P e r k e l , e t a l . , 1964).
The m e a n r a t e output of a n e u r o n thus
r e s p o n d s l i n e a r l y to the a l g e b r a i c s u m of the m e a n r a t e s of multiple inputs ( a s s u m i n g the inputs a r e tadependent--Segundo, et a l . , 196o) o v e r the r a n g e d e l i m i t e d by the s u p p r e s s i o n of the n e u r o n ' s output a n d i t s m a x i m u m f i r i n g r a t e .
If a d j a c e n t c e l l s a r e i n t e r r e l a t e d in s o m e
m a n n e r , the p r o c e s s i n g e l e m e n t s of the n e u r a l s y s t e m a r e m o r e a c c u r a t e l y the e n s e m b l e s of i n t e r d e p e n d e n t cells; the l i n e a r o p e r a t i n g r e g i o n s of such e n s e m b l e s m a y be c o n s i d e r a b l y g r e a t e r than t h a t of the c o n s t i t u e n t n e u r o n s , depending on the d i s t r i b u t i o n of the individual ranges.
( W h e t h e r the p r o c e s s i n g e l e m e n t s a r e individual c e l l s o r g r o u p s of i n t e r r e l a t e d
c e l l s , they can be r e p r e s e n t e d c o n c e p t u a l l y a s single n e u r o n s with no loss in g e n e r a l i t y , ) The p r o p e r t y of [ i n e a r i t y leads to g r e a t s i m p l i f i c a t i o n in the m a t h e m a t i c a l d e s c r i p t i o n of the s y s t e m - a s i m p l i f i c a t i o n t h a t i s a l s o enjoyed in optical holography by v i r t u e of the l i n e a r i t y of the wave equations d e s c r i b i n g the p r o p a g a t i o n of light t h r o u g h m o s t m e d i a . The second and m o s t i m p o r t a n t a t t r i b u t e of the m e a n r a t e p a r a m e t e r is that its use in v a r i o u s f o r m s a s a code for s t i m u l u s p r o p e r t i e s h a s b e e n d e m o n s t r a t e d in m a n y n e u r a l s t r u c t u r e s ( P e r k e l and Bullock, 1968).
The two f o r m s of m e a n r a t e coding m o s t p r e v a l e n t in the
b r a i n a r e f r e q u e n c y modulation o r m e a n r a t e modulation (MRM) and d i r e c t i o n a l r a t e change
18
DRC, most frequently called simply mean rate coding, but it will be labelled differently here to emphasize that frequency modulation is also a mean rate code . Although other codes have been identifiedI, the analysis of neural holographic processes will center on these two. Both involve a base rate of random firing; MRM implies a periodic oscillation of the mean rate about the base level and is a candidate code wherever periodicity is found-e . g . , the theta rhythm (4-7 Hz) in the hippocampus, the alpha (8-13 Hz) in the thalamus and cortex, and beta (20-30 Hz) in the cortex; DRC is the classical code for stimulus intensity and involves a continuing increment of decrement in the mean firing rate about the base level as shown by De Valois, et al. (1962) in the lateral geniculate. The MRM code can be represented by a cosine function:
(4)
mean rate = r+ M cos(2~rft+e) r f t 0 -
M
For the MRM generator Thus,
code to be meaningful
of the carrier frequency
f will be the same
in a neural holographic
(a pacemaker)
process,
that modulates
there must be a single
all the spike trains involved,
for all spike trains and 0, the phase of the modulation
train, will be with respect to a common The DRC
the base rate amplitude of deviation from base rate frequency of modulation time phase of the particular spike train relative to some reference
code can be expressed
senting the direction--increment
for each
reference. in terms
or decrement--of
of a binary function, the change in mean
denoted
evn,
repre-
rate.
eva0 = (_±)0
0 - the direction index, taking integer values
mean rate = r+ Mevn0
r, M - as before
(5)
Thus the mean rate increases by M if the direction index, 0, is even and decreases by" M if it is odd. The direction index is in some respects analogous to phase; unlike phase, howe v e r , it i s a d i s c o n t i n u o u s d i m e n s i o n .
i
Mean rate codes are, in general, the most suitable for holographic purposes. If more than one type of code supports storage and reconstruction, it might be possible to superimpose the various codes (assuming they are orthogonal) and simultaneously store and retrieve independent information wavefronts in the same storage area. Distribution coding, although it has been frequently observed (Perkel and Bullock, 1968), is an improbably candidate for significant holographic processing. First of all, with many weak, ~ndependent syaaptie inputs (which must be assumed for redundant storage to occur), the distribution of output firing bears no relation to input distributions (Segundo, et al., 1968). Second, even under the condition of a limited number of relatively strong inputs, storage and retrieval of distribution parameters other than the mean is possible only in a number of special cases.
19 The n a t u r a l o c c u r r e n c e of t h e s e two m e a n r a t e c o d e s m a k e s the r e q u i r e m e n t s for h o l o g r a p h i c s t o r a g e f a r l e s s r e s t r i c t i v e in the n e u r a l c a s e than in the optical.
The s t r u c -
t u r a l c o h e r e n c e of the fixed i n t e r n e u r a l c o n n e c t i o n s and the t i m e - a v e r a g e d p r o p e r t y of the c o d e s for w h i c h n e u r o n s a r e l i n e a r t r a n s d u c e r s p e r m i t a s t a b l e s p a t i o - t e m p o r a l i n t e r a c t i o n of w a v e f r o n t s t h a t have no fixed f r e q u e n c y o r p h a s e r e l a t i o n s .
It r e m a i n s to be d e m o n s t r a t e d ,
h o w e v e r , that the n e u r a l i n t e r f e r e n c e p a t t e r n s can be s t o r e d i s o m o r p h i c a l l y by s o m e p r o c e s s of n e u r o n a l change.
B e f o r e c o n f r o n t i n g t h i s t a s k , the n e u r a l s t r u c t u r e r e q u i r e d for h o l o -
g r a p h i c p r o c e s s e s will be analyzed. N e u r a t R e p r e s e n t a t i o n of Symbolic I n f o r m a t i o n The two codes d e s c r i b e d above c h a r a c t e r i z e single spike t r a i n s .
A neural wavefront
i s s i m p l y a s p a t i a l a r r a y of spike t r a i n s a n d will be c o n s i d e r e d the mode of r e p r e s e n t a t i o n for s y m b o l i c i n f o r m a t i o n in the b r a i n ( s t i m u l u s p a t t e r n s , c o n c e p t s , m o t o r c o m m a n d s , e t c . ) . F i g u r e 2 d e p i c t s a p o s s i b l e s t r u c t u r e for a n e u r a l h o l o g r a p h i c s y s t e m ,
a and b a r e
input w a v e f r o n t s t h a t m a p t h r o u g h t r a n s f o r m s X a n d Y, r e s p e c t i v e l y , onto the s t o r a g e field
feedback j . m - - - - - - m
/ / I
OUTPUT
I-----t.
© ©
FIELDS
a m
© STORAGE
iNPUT
--O-U
FIELD
FIELDS
b
/
/
/
11 feedback
FIGURE 2: A p o s s i b l e s t r u c t u r e f o r a h o l o g r a p h i c n e u r a l s y s t e m .
¸
20
neurons.
7 i s the d i a g o n a l m a t r i x of t r a n s m i s s i o n c o e f f i c i e n t s e x p r e s s i n g the l i n e a r
r e l a t i o n b e t w e e n the a l g e b r a i c s u m of the inputs to e a c h n e u r o n and the m e a n output r a t e of each neuron--i, e.,
• r e p r e s e n t s the e f f i c i e n c y with w h i c h input r a t e v a r i a t i o n s a f f e c t o u t -
put r a t e v a r i a t i o n s .
W and Z m a p t h i s output e_ onto u and v.
The transforms X,Y,W,
and Z a r e s u c h t h a t with no i n f o r m a t i o n r e c o r d e d in the s t o r a g e a r e a ,
a a n d b a r e a b l e to
c r o s s t h r o u g h e a c h o t h e r and end up s e p a r a t e l y in u and v, r e s p e c t i v e l y , w o r d s , p r o d u c e s no output in v a n d b no output in u.
a__, in o t h e r
S i m u l t a n e o u s l y e x p o s i n g the s t o r a g e
field to a a n d b a l t e r s the t r a n s m i s s i o n c o e f f i c i e n t s of t h e s e n e u r o n s in p r o p o r t i o n to the m
i n t e r f e r e n c e p a t t e r n of a a n d b.
T h e s p a t i a l v a r i a t i o n s of T w h i c h code t h i s i n t e r f e r e n c e
p a t t e r n now allow w a v e f r o n t a to p r o d u c e output in v which, it will be shown, i s a r e c o n s t r u c t i o n of b ' s output to u.
T h u s , the s p a t i a l v a r i a t i o n s of 7 a r e the n e u r a l h o l o g r a m .
Expressing these relations mathematically: u = We
(6)
v =
(7)
zc
c = r +T(Xa+Yb) --
(8)
C
A = Xa
(9)
B = Yb
(i0) - denotes that the elements are coded spike trains a, b - input wavefronts (column crete pulse trains u, v - wavefronts arriving (column vectors)
of the variable
vectors)
of dis-
at the two output fields
c - w a v e f r o n t output f r o m the s t o r a g e field neurons W , X , Y, Z - t r a n s f o r m m a t r i c e s of s y n a p t i c c o u p l i n g coefficients A,B__- the input w a v e f r o n t s a t the s t o r a g e field ( c o l u m n vectors) r
e
- c o l u m n v e c t o r of the b a s e f i r i n g r a t e s of the s t o r a g e field n e u r o n s
7 - d i a g o n a l m a t r i x of t r a n s m i s s i o n c o e f f i c i e n t s of s t o r a g e field n e u r o n s
I n i t i a l l y 7 i s a s c a l a r m a t r i x ( a l t h o u g h t h i s is not a n e c e s s a r y a s s u m p t i o n , it s i m p l i f i e s analysis).
21
T = kI u = W r +W~(Xa+Yb) = W r + W k l X a + W k l Y b --
e
c
u = W r +X(WXa+WYb) --
e
-
--
--
(Ii)
;
-
similarly, v = Zr
+X(ZXa+
ZYb_)
(12)
C
F o r a to produce output only in u and b only in v, WY = 0 ,
zx = 0
(13)
A f t e r r e c o r d i n g , the t r a n s m i s s i o n c o e f f i c i e n t s have been a l t e r e d in s o m e m a n n e r . lkv's a r e v a r i a b l e a c r o s s the s t o r a g e field.
These
F o r r e c o n s t r u c t i o n , a is again input, but b i s
z e r o (ignoring b a s e r a t e s ) . v = ZTXa = Z(~I+AT)Xa = Z~Ia+ ZATXa = ~ZXa+ ZA~Xa - average A7-diagonal
(14)
value of 7 matrix of variations
of ~- around
ZX=0 (~5)
V = ZATXa
Any t e r m in 7, t h e r e f o r e , that i s c o n s t a n t o v e r all s t o r a g e n e u r o n s d o e s not g e n e r a t e any output in the r e c o n s t r u c t i o n field.
Thus, A~-Xa m u s t contain Yb (i. e . ,
A~A m u s t contain
B) if an a c c u r a t e r e c o n s t r u c t i o n i s to be produced. The r e l a t i o n s between W and Y and Z and X e x p r e s s e d in equation (13) a r e e s s e n t i a l to the p r o c e s s i n g of the n e u r a l w a v e f r o n t s and a r e analogous to the r e c o r d i n g g e o m e t r i e s in optical holography that allow s e p a r a t i o n of output i m a g e s .
It i s p o s s i b l e ,
b e c a u s e of t h e i r i m p o r t a n c e to p r o c e s s i n g , that t h e s e r e l a t i o n s have developed through e v o lution; c o n v e r s e l y , u and v m a y s i m p l y be the s u b s e t of output fields of the s t o r a g e n e u r o n s whose t r a n s f o r m s obey t h e s e r e l a t i o n s . The feedback loops shown in F i g u r e 2 i l l u s t r a t e t h a t this s t r u c t u r e could be two c i r c u l a t i n g n e u r a l n e t s that i n t e r s e c t at a s e t of modifiable n e u r o n s .
The a s s o c i a t i o n b e -
tween the v a r i o u s " c e l l a s s e m b l i e s " (Hebb, 1949) r e a l i z a b l e in the n e t s thus o c c u r s at t h e i r intersection. Finally, in analyzing the s t o r a g e and r e c o n s t r u c t i o n , only the w a v e f r o n t s at the s t o r a g e field, A and B, n e e d be c o n s i d e r e d a s t h e s e a r e the w a v e f r o n t s that d i r e c t l y p r o duce the i n t e r f e r e n c e p a t t e r n to be s t o r e d .
The e x p r e s s i o n s for A and B a r e , for MRM
coding, w h e r e the s u b s c r i p t i i n d i c a t e s input activity at the i th s t o r a g e n e u r o n :
22
A = Xa = ~rAi+Aicos(2~rft+0i)~
(16)
]3 = Yb = [rBi + Bieos(2~rft+~i)]
(17)
and for DRC coding,
A__= Xa_ = [rAi+AievnOi~
(18)
]3-- Yb_= [rBi+,ievn i]
(19)
Models of Neuronal Change At present, the basis of neuronal change is unknown, but there are a number of hypotheses of the factors that might lead to such change (Kupfermann and Pinsker, 1969) and these fall into two main classes. The first states that the degree of usage of the synaptic terminals or of the postsynaptic cell somehow affects their subsequent efficiency, The second proposes that the concurrence of action potentials at the pre- and postsynaptic membranes and the consequent permeability- of both, allows some form of molecular communication that effects a change in transmission efficiency; the probability of concurrence at each synapse will depend both on the output rate of the postsynaptic cell and on the input rate at the synapse. To allow holographic storage, the neuronal change must code the linear interaction of the two inputs A and ]3 (i.e., A+D.
This requirement is met by the postsynaptic use
and concurrent use hypotheses, both of which reflect the output rate (A+ B) of the postsynaptic ceil; the synaptic use hypothesis, however, reflects only the input to each particular synapse and so cannot support
holographic processes.
Furthermore, since the inhibitory
and excitatory components of an input cancel in their effect on the output of the postsynaptic cell, isomorphic coding requires that their effects on the transmission efficiency of a cell also cancel. This is satisfied by the postsynaptic use hypothesis (simple use) where neuronal change is a function only of the output rate of the postsynaptic cell. In the case of concurrent use, the agent of neuronal change is the substance passing between pre- and postsynaptic processes and this interchange is a function not only of postsynaptic firing but also of the input rates at each synapse.
For the molecular agents of inhibitory and excita-
tory inputs to counteract each other, they must be mutually antagonistic and must be able to diffuse and interact, even if only on a local basis (assuming random spatial distribution of inputs), after passing across the postsynaptic membrane.
If input to each cell is either all
inhibitory or all excitatory, this cancellation requirement is, of course, unnecessary and the transport can be in either direction across the synaptic cleft (this form of the concurrence hypothesis is typically called specific use).
23 F i n a l l y , it can be shown that when the function e x p r e s s i n g n e u r o n a l change (the t r a n s m i s s i o n function) c o n t a i n s l i n e a r t e r m s in A o r B_, s i g n i f i c a n t n o i s e r e s u l t s in the r e c o n s t r u c t i o n field.
Since MRM coding is p e r i o d i c , any l i n e a r ' t e r m s will a v e r a g e to z e r o
o v e r one period; DRC coding, h o w e v e r , i s not t i m e v a r y i n g and l i n e a r t e r m s c a n only be s u p p r e s s e d in the c o n c u r r e n c e h y p o t h e s e s with c e r t a i n r e s t r i c t i o n s and c a n n o t be s u p p r e s s e d a t all in the s i m p l e use c a s e ( r e q u i r i n g , t h e r e f o r e , the a b s e n c e of l i n e a r t e r m s , and, in fact, a l l o d d - p o w e r e d t e r m s , in the t r a n s m i s s i o n function). To s u m m a r i z e the p r o p e r t i e s of the v a r i o u s h y p o t h e s e s : h o l o g r a p h i c s t o r a g e of MRM coded input i s s u p p o r t e d by s i m p l e and c o n c u r r e n t u s e and by specific use when input to e a c h cell is e i t h e r all e x c i t a t o r y o r i n h i b i t o r y ; h o l o g r a p h i c s t o r a g e of DRC coded input is p o s s i ble for s p e c i a l c a s e s of s i m p l e and s p e c i f i c use; the c h a n g e in n e u r o n a l t r a n s m i s s i o n e f f i c i e n c y (7) i n v o l v e s the cell a s a unit in s i m p l e use, local a r e a s of the cell in c o n c u r r e n t use (in both c a s e s , the c h a n g e a f f e c t s a l l input to the c e l l equally), and individual s y n a p s e s in specific use. The n e u r a l h o l o g r a p h i c p r o c e s s will be a n a l y z e d for the c a s e of c o n c u r r e n t u s e w h e r e e a c h c o n c u r r e n c e c o n t r i b u t e s equally to the change in t r a n s m i s s i o n efficiency.
Although any
n u m b e r of o t h e r m o d e l s could have been c h o s e n for a n a l y s i s , this p a r t i c u l a r model h a s a n u m b e r of a d v a n t a g e s : it o f f e r s m o r e s t r u c t u r e a n d f e w e r r e s t r i c t i o n s than the s i m p l e use model; it a p p l i e s equally to p r o c e s s i n g units of single c e l l s o r e n s e m b l e s of c e l l s ; the e q u a l i t y of the e f f e c t of e a c h c o n c u r r e n c e i s i n t u i t i v e l y a t t r a c t i v e ; the r e s u l t s g e n e r a l i z e r e a d i l y to the specific use model; and b e h a v i o r a l data d i s c u s s e d in the l a t t e r half of t h i s p a p e r show t h a t the t r a n s m i s s i o n function m u s t be a n e x p o n e n t i a l (Cavanagh, 1972) and s u c h a function is a f u n d a m e n t a l c h a r a c t e r i s t i c of the model to be c o n s i d e r e d . The s e l e c t e d model p o s t u l a t e s that c o n c u r r e n t u s e l e a d s to change, but change in what d i r e c t i o n ? Most e x p e r i m e n t a l e v i d e n c e , e s p e c i a l l y in the p e r i p h e r a l n e r v o u s s y s t e m , s u g g e s t that use w e a k e n s , r a t h e r than s t r e n g t h e n s , the t r a n s m i s s i o n e f f i c i e n c y of a c e l l when input i s e x c i t a t o r y ( S h a r p l e s s , 1964).
Such a c h a n g e i s c o m p a t i b l e with the p h e n o m e n a of
habituation, extinction, and s p o n t a n e o u s r e c o v e r y , a m o n g o t h e r s .
G r i f f i t h s (1966) h a s
d e m o n s t r a t e d how this w e a k e n i n g a c t s a s n e g a t i v e f e e d b a c k to s t a b i l i z e n e u r o n output; if, c o n v e r s e l y , use led the s t r e n g t h e n i n g , the c o n c o m i t a n t p o s i t i v e f e e d b a c k would produce i n s t a b i l i t y o r r u n a w a y in the c e l l ' s output. No e x p e r i m e n t a l work has been done on the e f f e c t s of i n h i b i t o r y input.
However, to
obtain the s a m e s t a b i l i t y , c o n c u r r e n c e of the posts)~aaptic a c t i o n potential with the a r r i v a l of i n h i b i t o r y i m p u l s e s m u s t lead to s t r e n g t h e n i n g of the e f f e c t i v e n e s s of i n h i b i t o r y input. w e a k e n i n g (i. e . , r e l e a s e f r o m inhibition) w e r e to r e s u l t , the c e l l ' s output would a g a i n i n crease autonomously.
If
24 The c o n c u r r e n c e of action p o t e n t i a l s a t a s y n a p s e m u s t a f f e c t not only the s y n a p s e involved but a l s o n e i g h b o r i n g s y n a p s e s which may be of s i m i l a r o r d i f f e r e n t n a t u r e .
This can
be a c c o m p l i s h e d if the m o l e c u l a r agent r e l e a s e d by an inhibitory c o n c u r r e n c e s t r e n g t h e n s , and that r e l e a s e d by an e x c i t a t o r y c o n c u r r e n c e w e a k e n s , the r e c e p t o r s e n s i t i v i t y of e i t h e r type of s y n a p s e . quired.
T h e s e two actions a r e then also mutually a n t a g o n i s t i c , a s p r e v i o u s l y r e -
Since the model is a d d r e s s i n g s h o r t t e r m m e m o r y p r o c e s s e s with a time s c a l e in
the o r d e r of s e c o n d s , such c h a n g e s in r e c e p t o r s e n s i t i v i t y ( a s s u m i n g e x c i t a t o r y input) might be s e e n on a g r o s s level as fatigue or a c c o m m o d a t i o n , a c o n s i s t e n t l y o b s e r v a b l e c e l l u l a r phenomenon. V a r i o u s a s s u m p t i o n s have been made c o n c e r n i n g the m e c h a n i s m s of n e u r o n a l change and the a n a l y s i s of holographic s t o r a g e and r e t r i e v a l will now be undertaken b a s e d on t h e s e assumptions.
It m u s t be e m p h a s i z e d that the f e a s i b i l i t y of holographic p r o c e s s e s does not
depend on t h e s e a s s u m p t i o n s and that equivalent d e r i v a t i o n s r e s u l t f r o m a v a r i e t y of o t h e r neuronal m o d e l s . F i g u r e 3 shows a single neuron (chosen a r b i t r a r i l y so that no s u b s c r i p t s will be used) w h e r e A r e p r e s e n t s the a l g e b r a i c s u m of input f r o m the a w a v e f r o n t and B the s u m f r o m the b w a v e f r o n t .
A
B
m
m
"t
÷
FIGURE 3: A single neuron in the s t o r a g e field. A and B a r e the s u m s of all the input e f f e c t s f r o m a and b r e s p e c t i v e l y .
25
Considering the MRM code, when the total synaptic effect is positive, then the output of the cell is in phase with the input.
With multisynaptic input, the input and output p r o c e s -
ses can be c o n s i d e r e d independent t with l i n e a r l y r e l a t e d means.
The expected n u m b e r of
c o n c u r r e n t p r e - and postsynaptie action potentials (hits) per unit t i m e is then d i r e c t l y p r o portional to the product of the mean input and output r a t e s . E(hit) = E {(re + 7(A+ B)). (A+ B)} .
(20) E - expected value
Assuming that the duration of exposure, t, is a random v a r i a b l e unrelated to the period of the modulating wavefront, the expected number of hits can be e s t i m a t e d by a v e r a g i n g o v e r one period,
E(hit) =
• ( r A + r B + A c o s ( 2 ~ t + 0) + B c o s ( 2 ~ t + ~)) d(2~ft) E(hit) = T(rA+ rB)2+ r c ( r A + r B) + 7(A2+ B2+ 2AB cos ~)
(21)
w h e r e ~/= 0 - ~ . "~ - phase difference between the two inputs If each hit contributes an equal amount to the weakening of the t r a n s m i s s i o n efficiency, then the r a t e of change of 7 will be l i n e a r l y r e l a t e d to E(hit).
A s s u m i n g an e q u i l i b r i u m
p r o c e s s that maintains T at a steady level when there is no input other than the base r a t e s , the e x p r e s s i o n is d~-dt = - aE(hit) + a ( 7 ( r A + r B) 2 + r c ( r A + rB)~ = -~'r(A2+ B2+ 2AB cos ~
(22)
Integrating o v e r t, the total t i m e for which the storage neuron is exposed to A and B_
=
~te- at(A2 + B2 + 2AB cos
(23) a, ~t - constants.
1
While an a r r i v i n g spike may initiate an action potential (or suppress an i m m i n e n t one in the c a s e of inhibitory input) at or n e a r the r e c e i v i n g postsynaptic site, this s p a t i o - t e m p o r a l input-output dependence only o c c u r s with significant frequency for the few synapses n e a r the axon hillock. With the number of input p r o c e s s e s in the o r d e r of thousands (10,000 synapses is typical in the cortex), the m a j o r i t y of s p a t i o - t e m p o r a l l y simultaneous p r e - and p o s t s y n aptic action potential a r r i v a l s will o c c u r as the postsynaptic action potential sweeps through the dendritic t r e e . Thus, for determining the rate at which these even a r e achieved, the input and output p r o c e s s e s a r e effectively independent.
26 If the total synaptic effect is inhibitory, the output c will d e c r e a s e when input (A+B) i n creases.
Therefore E(hit) = E { ( r c - v(A+ B.))"(A+ B)}
(24)
and the average, as in equation (21), over one period is E(hit) = -7(rA+ rB)2 + r c ( r A + r B) - "r(A2 + B2+ 2AB cos 3')
(25)
However, each hit now contributes to the i n c r e a s e of 7. Again, with an e q u i l i b r i u m process, dtd7 _ + O~E(hit)+ ~(7(rA+ r B) - r c ( r A + rB)~ = -~T(A2+ B 2 + 2AB cos 3') ,"
again, 7 = ke - a i ( A 2 + B 2 + 2 A B e ° s 3 ` ) As expected, both excitatory and inhibitory input (and therefore any combination of the two) lead to the same storage c h a r a c t e r i s t i c .
~ r e p r e s e n t s the storage p a r a m e t e r , the
strength with which incoming information a l t e r s the cell. k is simply the base level of 0with no information stored and t r e p r e s e n t s the exposure time of the input. The e l e m e n t s of [7], the diagonal m a t r i x of t r a n s m i s s i o n coefficients that codes the n e u r a l hologram, are given by 2 2 -c~t(A. + B. + 2A.B.cos 3`.) I
I
I
I
1
ii
For the DRC code, there a r e limitations on the i n t e r n e u r a l connections and base firing rates that will allow useful storage.
The r e s t r i c t i o n s a r e that the total synaptic effect
must be inhibitory and that the base r a t e s a r e r e l a t e d as follows: r e = 2(rA+rB)
.
(26)
In e l e c t r i c a l engineering t e r m s , equation (26) places the quiescent point midway in the o p e r ating range of the neuron, tt is the optimum operating point in that it allows the m a x i m u m signal input without distortion; n e v e r t h e l e s s , it is a definite r e s t r i c t i o n on the generality of the model.
The expected rate of hits in this case is
E(hit) = -~-(rA + r B) 2+ r c ( r A + rB ) + ( r c _ 2~r(rA + rB)~ "(Aevn0 + Bevn~) - 7(Aevn0 + Berne) 2 Because of the r e s t r i c t i o n of equation (26), this reduces to E(hit) = -T( rA+ r B) 2 + rc (rA+ rB ) _ T(Aevn0 + Bevu~) 2
(27)
27 Thus the c o m b i n e d effect of the two r e s t r i c t i o n s is to e l i m i n a t e the f i r s t o r d e r t e r m s of evn0 and evn~.
It c a n be shown t h a t t h e s e t e r m s m a k e any useful r e c o n s t r u c t i o n of i n f o r m a -
tion i m p o s s i b l e . T h e r a t e of change of ~ i s now d--'TT ' dt = v~E(hit) + ~ (T(r A + r B) 2 _ r c ( r A + rB)~ = _ ~-r(Aevn0 + Bevn~) 2 ," since
(evnO)2,
(evn¢) 2 = 1
and even0 • evn¢ = e v n ( 0 - ~), d7 - - a'r(A2+ B2+ 2ABevn'?) dt
(23)
w h e r e "t' = 0 - ~ ; thus
~- = )te-~t(A2+ B2+ 2ABevnT) 2
(29)
2
-a't(Ai+ Bi + 2AiBievn~i) and
~..
=Xe
Ii
Both codes have led to the c o n c l u s i o n of an e x p o n e n t i a l s t o r a g e c h a r a c t e r i s t i c .
That
is, the t r a n s m i s s i o n c o e f f i c i e n t s of the n e u r o n s which encode the i n t e r f e r e n c e p a t t e r n of the two w a v e f r o n t s v a r y e x p o n e n t i a l l y w i t h the input s i g n a l s .
It h a s been shown o p t i c a l l y
( F r i e s e m and Zelenka, 1967) t h a t r e c o n s t r u c t i o n is p o s s i b l e with n o n l i n e a r r e c o r d i n g c h a r acteristics.
The m a i n effect of the n o n l i n e a r i t y is to produce the h i g h e r o r d e r i m a g e s a n a l -
ogous to the h i g h e r o r d e r d i f f r a c t i o n s f r o m an optical g r a t i n g .
T h e s e unwanted i m a g e s c a n
t y p i c a l l y be s e p a r a t e d f r o m the d e s i r e d r e c o n s t r u c t i o n . A t p r e s e n t , no a n a l y s i s of the p o s s i b i l i t y of d e c a y of s t o r e d i n f o r m a t i o n will be m a d e , a s it does not play an i m p o r t a n t r o l e in the b e h a v i o r a l t a s k s to which the m o d e l will be applied.
The m e c h a n i s m of s t o r a g e i m p l i e s that t h e r e m a y be a n e x p o n e n t i a l d e c a y although
this is not s t r i c t l y t r u e .
The i n f o r m a t i o n m i g h t r e m a i n u n c h a n g e d o v e r t i m e until s o m e e x -
t e r n a l c o n t r o l signal e f f e c t i v e l y c a u s e s it to be e r a s e d .
In a s i m i l a r m a n n e r , a c o n t r o l s i g -
nal m i g h t a l s o g o v e r n the r e c o r d i n g of i n f o r m a t i o n , i n c r e a s i n g the value of a (equations (23) a n d (29)) to s t o r e i n t e r f e r e n c e p a t t e r n s and d e c r e a s i n g o~ to i g n o r e t h e m . Reconstruction Having developed e x p r e s s i o n s f o r % the f o r m of the r e c o n s t r u c t e d w a v e f r o n t c a n now be d e t e r m i n e d .
Initially, the a m p l i t u d e moduli, A and B, will be a s s u m e d c o n s t a n t for
e a c h n e u r o n to s i m p l i f y the d e r i v e d e x p r e s s i o n s ; the effect of r e l a x i n g t h i s a s s u m p t i o n i s a n a l y z e d at the end of this s e c t i o n .
28 To obtain r e c o n s t r u c t i o n after the interference pattern of A and B has been stored, A alone or B alone is input to the storage field. M R M Code. Considering reconstruction with the input of the A wavefront, output at
an a r b i t r a r y neuron is 2 2 _e = re + h e - t~t(A + B + 2AB cos T) • (rA+ rB+ A cos(2~Trft+ 0)) .
(30)
As demonstrated by Tokarski (196d) in the optical c a s e , the t r a n s m i s s i o n coefficient can be expanded in a F o u r i e r cosine s e r i e s to determine the image producing t e r m ,
C : rc+(rA+rB+ACos(27rft+0)~.
~ . . ~ T cos(m 0 m /
Tm , m = 0,1,2,...
(31)
- F o u r i e r coefficients.
Only the t e r m for m = I will contain a r e p l i c a of the B wavefront, all t e r m s for m > 1 produce higher o r d e r images.
The m = 0 t e r m is a constant.
The f i r s t two F o u r i e r coef-
ficients a r e 27T
1 TO= ~
I
e
-~t(A2+ B2+ 2ABcos
dT = e-°~t(A2+ B2)
• 10(2~AB)
(32)
0
10 - zero order modified
Tt=
Bessel function,
1 1 27r e - err(A2+ B2+ 2AB cos T) 7r • cos TdT = -2e-e~t(A2+ B2). i i(2~tAB) 0
11 - first order mofified Bessel function; thus (3O
C_= r c + (rA+ rB) X ( ~ 0
TmCOS(mT)~ + A cos(27rft+ 0) he-a~:(A2+ B2) 10(2~AB )
- A cos(27rft+ 0) @ ~ e - ~ t ( A 2 B2). 1 l(2a~tAB)~ cos T+ higher o r d e r t e r m s
(34)
In equation {34) : rc will produce the base firing r a t e s at the output field; rA+ r B and cos mT a r e independent and so w{ll generate a randomly distributed noise field that is subsumed in the base r a t e s at v; the third t e r m is constant for all the neurons of the storage field so that there is no output in v as a r e s u l t of this t e r m (equations (14) and (15)); the fourth t e r m is the reconstruction term; the higher o r d e r t e r m s propagate to v, but, analogous to the optical case, can be s e p a r a t e d from the d e s i r e d reconstruction by the t r a n s f o r m Z. The r e c o n -
29 struction t e r m is then c = -Xae -at(A2+ B2) r
11(2 tAB) (2 cos(2 t+ 0)- cos
but "y= 0 - ~ c = -kAe-a~t(A2+ B2) t (2~tAB) (eos(27rft + ~) + cos(2~ft+ 20- ~)) . r 1
(35)
Since amplitude moduti were assumed constant, only the phase of the B wavefront need be recovered for reconstruction.
This is the case in equation (35), the f i r s t cosine t e r m being
the phase of B_. The leading t e r m s r e p r e s e n t the amplitude of the ]3 reconstruction; the second cosine term is the complement of B and is s i m i l a r to the conjugate image in optical holography. Thus a linear reconstruction of the B wavefront has been obtained (the linearity is partially a result of the assumption of constant amplitude moduli) allowing the conclusion that neural holography can be achieved using this very general mean rate modulation code. The complementary and higher o r d e r reconstructions are equivalent to the multiple images produced in optical holography. It is reasonable to assume that these can be separated from the desired reconstruction given the appropriate anatomy of the neural structure. DRC Code. The analysis of reconstruction with the DRC code leads to a rather significant result.
Considering again input of the A wavefront alone, equations (6) and (29)
give c = r c - ( rA+ r B+ Aeven0) k e - c~t(A2+ B 2+ 2ABevn~ Expanding the variable part of the exponential,
c_ = r e - (rA+ rB+ hevn0)
ke-~t(A2+ B 2)
( - l i - 2 c~tABevn~/+
(2o~tABevnT)2 2'
}
but (e~Y) 2 n = 1 and (evaT) 2n+l = evn~,
n - any integer
c_ = r c - (rA+ rB+ Aevn0) k e - at(A2+ B2) • %1 + (2~AB)22,-----~--+ (2aCAB)44------~-+ " "
-(2a'tAB)evn7- ( 2 ~ B ) 3 evn~- (2atAB)5 3~ 51 evnT- . . . t
c = r c - (rA+ rB+ Aevn0) ke" tit(A2+ B2). (cosh(2a,tA B) - sinh(2atAB) evnT)
(36)
30 2 2 _c = r c - ( r A + r B+ Aev n 0)~.e - c~t(A + B ) cosh( 2~t AB)
+ ( rA+ r B) he - v~t(A2+ B 2 ) sinh( 2atA B) e v n 7 2 2 +~Ae-at(A +B )sinh(2~AB)evn0evn7
(37)
r
i s a g a i n the b a s e r a t e ; the s e c o n d t e r m c o n t a i n s the d i r e c t t r a n s m i s s i o n c o e f f i c i e n t which c is c o n s t a n t for all n e u r o n s and t h e r e f o r e allows p r o p a g a t i o n to u but not to v_j in the t h i r d
t e r m rA+ r B a n d evn~/ a r e i n d e p e n d e n t v a r i a b l e s and thus produce r a n d o m l y d i s t r i b u t e d n o i s e in v ; the fourth t e r m i s the r e c o n s t r u c t i o n t e r m .
c
r
= ~Ae-
at. 2+ 2. (A B ) sinh(2a'tAB)evnOevn7 ;
but evn0 • evaT = ewa(0 - 7) and 7 = 0 -
c
r
=
kAe_at(A2 +
2 B )sinh(2a~tAB) . e v n ~
(38)
The d i r e c t i o n d i m e n s i o n of the B- w a v e f r o n t is r e c o v e r e d (eraS) and s i n c e a m p l i t u d e moduli w e r e a s s u m e d c o n s t a n t , B h a s been l i n e a r l y r e c o n s t r u c t e d .
The i m p o r t a n t r e s u l t i s t h a t
only one w a v e f r o n t c o m p o n e n t is g e n e r a t e d ; the c o m p l e m e n t of B is not p r o d u c e d n o r a r e h i g h e r o r d e r i m a g e s , even though the r e c o r d i n g is n o n l i n e a r ( t h i s r e s u l t will hold f o r any f o r m of n o n l i n e a r i t y ) .
T h i s s i m p l i c i t y ia the output space, which c a n n o t be o b t a i n e d in the
optical o r n e u r a l MRM c a s e s , p e r m i t s a g r e a t deal of g e n e r a l i t y in the n e u r a l a n a t o m i e s a p p r o p r i a t e for h o l o g r a p h i c p r o c e s s e s . T h e Effect of V a r i a b l e A m p l i t u d e Moduli, The p r e v i o u s s e c t i o n s have d e a l t with s t o r a g e and r e c o n s t r u c t i o n with the a s s u m p t i o n of a c o n s t a n t a m p l i t u d e of input to e a c h neuron.
The i n f o r m a t i o n s t o r e d and r e c o v e r e d was that of p h a s e o r d i r e c t i o n .
Allowing the
a m p l i t u d e moduli, A and B, to v a r y o v e r the s t o r a g e n e u r o n s i n c r e a s e s the a m o u n t of i n f o r m a t i o n t h a t can be r e p r e s e n t e d , while still p e r m i t t i n g the faithful r e c o v e r y of p h a s e o r direction.
It is not p o s s i b l e , h o w e v e r , to r e c o v e r the a m p l i t u d e t e r m s without a c e r t a i n
a m o u n t of n o i s e a n d d i s t o r t i o n .
Since the condition of s t r i c t l y c o n s t a n t moduti i s unlikely in
the b r a i n , it is i m p o r t a n t to d e t e r m i n e the f o r m of the r e s u l t i n g d i s t o r t i o n . E x a m i n a t i o n of e q u a t i o n s (34) and (37) shows t h a t t h e r e a r e t h r e e s o u r c e s of d i s tortion.
F i r s t , the t e r m s
[~te - a t ( A 2 + B 2 ) 10(2v~tAB) },J f r o m equation (34), and
~Xe - a t ( A 2 + B2)cosh(2o~tAB)}, f r o m equation (37), a r e the d i r e c t t r a n s m i s s i o n c o e f f i c i e n t s .
31 As the constant terms in 7, they allow propagation to u but not to v. With variable moduli, these expressions are no longer constants. Their spatial variation is independent of 0 and and so produces a uniform noise output to v that increases in proportion to the variance of A and B. The effect of the noise depends on the ratio of the "area" in v to which the B wavefront propagates, to the total "area" reached by the noise. This ratio is determined by the output transform Z which could theoretically shrink the reconstruction "area" to minimize the effect of the noise. The second source of distortion arises from the encoding of the amplitude in the product of an exponential and a Bessel (equation (34)) or a hyperbolic sine (equation (37)) function. To determine if the amplitude of B is recoverable, the products are expanded; from (34)
~tA •e
-atA2 F
f l -OttA2\3 F
+
(39)
and from (37)
The expansions do contain first order terms in B. The first nonlinear term is cubic; however, the coefficient of this term can be made to equal zero with appropriate values of ~, t and A. The third source of distortion can be seen in equations (39) and (40). The terms to the left of the braces should be constant for a faithful reconstruction; the value of A, however, is variable. The variance of A around its mean value thus superimposes a random field of noise on top of the reconstructed B__wavefront. Againthere is a tradeoff between the increased information capacity with variable moduli and the resulting increase in noise. These sources of noise and distortion are similar to those faced in optical holography where a careful choice of recording geometries and techniques usually suffices to minimize their effects. It is evident that if the brain were to use holographic storage, it too would have to make careful choices of neural transforms and signal codes; these choices could be made by natural selection in evolution. In addition, the brain might have another mechanism to aid in noise suppression. If the neural holographic structure were two intersection networks as suggested previously, the self-seeking reverberations of such networks could act as feedback to suppress nonlinearities and random variability.
32 Storage of m o r e than one i n t e r f e r e n c e p a t t e r n It is p o s s i b l e for the n e u r a l h o l o g r a m to r e c o r d m o r e than one i n t e r f e r e n c e p a t t e r n while still allowing s e p a r a t e r e t r i e v a l of w a v e f r o n t s f r o m individual p a t t e r n s ,
The e q u i -
v a l e n t optical c a s e ( m u l t i p l e s t o r a g e on t w o - d i m e n s i o n a l h o l o g r a m s ) h a s been a n a l y z e d by C o l l i e r and P e n n i n g t o n (i967); t h e i r study showed that r e c o n s t r u c t i o n with no c r o s s t a l k i s p o s s i b l e when the w a v e f r o n t s b e i n g s t o r e d a r e uniquely c o d e d - - i , e , , t h e i r c r o s s - c o r r e l a t i o n s with o t h e r w a v e f r o n t s to be s t o r e d a r e m i n i m a l o r z e r o .
T h i s r e s u l t g e n e r a l i z e s r e a d i l y to
the n e u r a l c a s e as the w a v e f r o n t s A and B v a r y uniquely o v e r the s t o r a g e field and c a n be a s s u m e d to h a v e little c o r r e l a t i o n to s u b s e q u e n t s e t s of w a v e f r o n t s b e i n g s t o r e d .
Collier
and P e n n i n g t o n r e p o r t e d that the c r o s s t a l k in this c a s e is t r a n s f o r m e d into u n i f o r m l y d i s t r i b uted n o i s e t h a t does not i m p a i r r e c o n s t r u c t i o n . Storage of m u l t i p l e p a t t e r n s in the n e u r a l c a s e i s a c h i e v e d by the s e q u e n t i a l e x p o s u r e of the s t o r a g e field to p a i r s of input w a v e f r o n t s .
F o r the MRM code then,
N 7=kexp
'
2
2
(-~_~t.(A.+B.+2A.B.cos~) \ j=l j J J JJ
, N - n u m b e r of p a t t e r n s s t o r e d .
A s s u m i n g t h a t the w a v e f r o n t s have the s a m e a v e r a g e a m p l i t u d e moduli and that e x p o s u r e times are equal,
N :~ = k exp
c~Nt(A2+ B 2) - 2~tAB
, cos j=l
Expanding a s the p r o d u c t of N F o u r i e r c o s i n e s e r i e s (equations (32) and (33)), N 7 = k e -~Nt(A2+ B 2 ) . - ~ {10(2~tAB) - 2 t l ( 2 C ~ A B ) c o s 7 j + . . .} j=l
7 = k e - ~'Nt(A 2+ B 2 ) (10 (2a~AB)) N N
B2). (10(2 AB))N-1.
-
COS ~/~ j=l
+ i n t e r m o d u l a t i o n and h i g h e r o r d e r t e r m s
(4~)
The f i r s t t e r m i s the d i r e c t t r a n s m i s s i o n coefficient; the s e c o n d is the r e c o n s t r u c t i o n t r a n s .th m i s s i o n c o e f f i c i e n t - - e a c h cos % c o n t a i n s the i n f o r m a t i o n for r e c o n s t r u c t i o n of the j waveJ front. I n t e r m o d u l a t i o n or c r o s s t a l k is produced, on input of the i th w a v e f r o n t , by the c o s i n e t e r m s for j ~ 1 and by the t e r m s c o n t a i n i n g p r o d u c t s of two o r m o r e c o s i n e s .
33 S i m i l a r l y for the DRC code, N v = Xexp
cgNt(A2+
-2atAB
, evn j=±
Expanding as a product of N T a y l o r s e r i e s (from equation (36)), T = ~. e-C~Nt(A2+ B2) •
T = k e -aNt(A2+ B2)
N ~-~ {cosh(2~AB) - sinh(2atAB)" e v n ~ } j=1
cosh(2~tAB)) N N j=l
+ intermodulation terms
(42)
The terms are equivalent to those for the MRM code. Notice in equations (41) and (42) that the reconstruction transmission coefficients have the same value for each of the N patterns. That is, the order of storage does not affect the amplitudes of the reconstructed wavefronts. This lack of a serial position effect would not have resulted if some form of storage decay had been assumed.
Noticealso that
the amplitude of reconstruction decreases exponentially with the number of patterns stored. This implies that the transmission type neural hologram is a limited capacity store. Phase holography (Upatnieksand Leonard, 1970) does not attenuate amplitude as increasing numbers of patterns arc stored and so might be a candidate model for a large capacity store such as long term memory. Conclusions A mathematical analysis has shown that holographic storage can be achieved in the neural domain for information coded in terms of mean rates; as this is a time-averaged parameter, it is possible for individual spike trains in a wavefront to vary randomly in instantaneous frequency and phase--a striking contrast to the strict frequency and phase requirements of optical holography. The properties of the neural holographic system were investigated for two classes of codes assuming, for convenience, a linear effect of concurrent pre-and postsynaptic impulses.
Meanrate modulation (MRM) appeared more reason-
able in t e r m s of operating r e q u i r e m e n t s , although the directional r a t e change code (DRC)
did p e r m i t m o r e flexibility in neural t r a n s f o r m s .
Finally, the neural h o l o g r a m was shown
to be capable of multiple storage of associations such that information f r o m each individual association can be r e t r i e v e d separately.
34 T h e r e could be m a n y s t r u c t u r e s in the b r a i n t h a t a r e able to s u p p o r t t h e s e h o l o g r a p h i c processes.
The c o n f i g u r a t i o n of input c o n v e r g i n g f r o m two a r e a s is, of c o u r s e , w i d e s p r e a d .
It is only r e q u i r e d t h a t the n e u r o n s a t the i n t e r s e c t i o n be fatiguable for s h o r t t e r m s t o r a g e to o c c u r .
In addition, the two c o d e s a n a l y z e d a r e found in m a n y a r e a s of the b r a i n .
On the
o t h e r hand, h o w e v e r , it is a v e r y difficult t a s k to d e t e r m i n e w h e t h e r the a p p r o p r i a t e t r a n s forms are available,
T h u s , while holograph}, i s a f e a s i b l e s t o r a g e p r o c e s s in the b r a i n , the
c r i t i c a l physiological t e s t i s beyond r e a c h a t p r e s e n t . On the b e h a v i o r a l level, h o w e v e r , a r a n g e of powerful t e s t s of the h o l o g r a p h i c h y p o t h e s i s is p o s s i b l e and t h e s e a r e d e s c r i b e d in d e t a i l in a r e c e n t p a p e r (Cavanagh, 1972). In b r i e f , the p a p e r p o s t u l a t e s a s h o r t t e r m m e m o r y s y s t e m that s t o r e s the i n t e r f e r e n c e p a t t e r n s between the w a v e f r o n t of s e n s o r y i n f o r m a t i o n r e c e i v e d f r o m a s t i m u l u s and the w a v e f r o n t that codes the i n t e r n a l i n f o r m a t i o n or " m e a n i n g " of the s a m e s t i m u l u s .
This arrange-
m e n t allows r a p i d a c c e s s r e c o g n i t i o n of s e n s o r y e v e n t s and i m a g i n g of i n t e r n a l s y m b o l s (see F i g u r e 4} t The p a p e r i n v e s t i g a t e s r e a c t i o n t i m e (RT) p r e d i c t i o n s of the s y s t e m for a r e c o g n i t i o n t a s k developed by S t e r n b e r g (1966) in which a l i s t of i t e m s i s m e m o r i z e d and the r e a c t i o n t i m e to c l a s s i f y a t e s t i t e m a s to l i s t m e m b e r s h i p i s m e a s u r e d .
Since a t e s t s t i m u l u s whose
a p p r o p r i a t e i n t e r f e r e n c e p a t t e r n h a s b e e n s t o r e d ( m e m o r i z e d ) g e n e r a t e s a r e c o n s t r u c t i o n of its i n t e r n a l r e p r e s e n t a t i o n while a t e s t s t i m u l u s with no s t o r e d p a t t e r n does not, the h o l o g r a p h i c s y s t e m can c l a s s i f y s t i m u l i as positive (stored) o r n e g a t i v e (not stored) by m o n i t o r lag output to the r e c o n s t r u c t i o n a r e a
1
( F i g u r e 5).
A, the s e n s o r y r e p r e s e n t a t i o n , is a s s u m e d to be the end r e s u l t of s e n s o r y p r o c e s s i n g , w h a t e v e r the f e a t u r e e x t r a c t i o n s o r t r a n s f o r m a t i o n t h a t that m a y include. F o r e x a m p l e , in the v i s u a l s y s t e m , A m i g h t be the output of a r e a 19 of the v i s u a l c o r t e x . The t r a n s f o r m s r e q u i r e d by the h o l o g r a p h i c s y s t e m a r e s i m p l y t h o s e t h a t allow s e p a r a t i o n of r e c o n s t r u c t e d i m a g e s ; no o t h e r p r o p e r t i e s a r e n e c e s s a r y to s u p p o r t s t o r a g e and r e g r i e v a l . Additional p r o p e r t i e s a r e r e q u i r e d , h o w e v e r , to a c h i e v e the p a t t e r n r e c o g n i t i o n ability d e m o n s t r a t e d by the b r a i n . K a b r i s k y , et al. (±971) and G i n s b e r g (197i) have a n a l y z e d the v a r i o u s p o s s i b l e n e u r a l t r a n s f o r m s that a r e in a c c o r d with h u m a n p a t t e r n r e c o g n i t i o n a n d p e r c e p t u a l i l l u s i o n s . I t i s not n e c e s s a r y t h a t t h e s e be the t r a n s f o r m s that m a p A onto the s t o r a g e field n e u r o n s , they could equally well p r e c e d e the production of the A w a v e f r o n t . F i n a l l y , the a n a l y s i s of the h o l o g r a p h i c r e c o g n i t i o n s y s t e m a s s u m e s that X, Y, W, and Z a r e l i n e a r t r a n s f o r m s with r e s p e c t to the a v e r a g e a m p l i t u d e of a w a v e f r o n t . T h i s i m p l i e s that the column s u m s of e a c h t r a n s f o r m m u s t be c o n s t a n t a n d allows the input ( a and b_) and output (u and v) w a v e f r o n t s to be r e p r e s e n t e d by the v a l u e s of A, B, and c a t a single a r b i t r a r y n e u r o n in the s t o r a g e fieid. T h i s a s s u m p t i o n s i m p l i f i e s a n a l y s i s but i s not e s s e n t i a l in any way for h o l o graphic storage.
35
STORAGE to External label•
v
a
processes
to
Internal label•
cognitive
LTM
b
Hologram
RECONSTRUCTION a
to
v
cognitive processes
u B
N O RECONSTRUCTION -- a NOT STORED a"
--
FIGI~RE 4:
LTM
An holographic short term memory system. External information is represented by wavefront propagation from input (a.) through the storage field (A_) to the output field (u_), internal information, by propagation from b through B to v.
't A log I/I o I
~
Receptor/sensory transform
LI
ts
%!
1
!
ICo
I
Detectors
;I do !
r
I tdr "td° [
~.ol+r ~i d 1 Storage field
IH tR
FIGURE 5: S c h e m a t i c of s y s t e m a c t i v i t y upon p r e s e n t a t i o n of a t e s t s t i m u l u s . The gate s i g n i f i e s that a r e c o n s t r u c t i o n will o c c u r only if the i n t e r f e r e n c e p a t t e r n a p p r o p r i a t e to the t e s t s t i m u l u s has been s t o r e d . The i n h i b i t o r y input to the d i r e c t w a v e f r o n t d e t e c t o r p e r m i t s a posiLive r e s p o n s e if the r e c o n s t r u c t e d w a v e f r o n t i s d e t e c t e d b e f o r e the d i r e c t w a v e f r o n t . A, c , and c_ a r e r w a v e f r o n t a m p l i t u d e s , I i s the s t i m u l u s i n t e n s i t y and I 0 is the a~solute threshold.
Stimulus
I _
i
Reaction time components
Negative response
Positive response
37
Sternberg's (1966) original results have been replicated many times, over a wide variety of conditions. Typical data for this item recognition task are shown in Figure 6.
NEGATIVE RESPONSES
500
ss~Ct SS
4OO
~
POSITIVE
S~SS~,~ ~'
I
RESPONSES
300
1
2
3
4
N FIGURE 6: Typical r e a c t i o n t i m e r e s u l t s for the i t e m r e c o g n i t i o n task. N is the n u m b e r of i t e m s m e m o r i z e d . The i m p o r t a n t f e a t u r e s of the data a r e the l i n e a r i n c r e a s e in r e a c t i o n t i m e with i n c r e a s i n g length of the m e m o r i z e d list, the equality of the s l o p e s (which a r e u s u a l l y on the o r d e r of 30 to 40 m s p e r item) for positive and n e g a t i v e r e s p o n s e s - - i , e . , r e s p o n s e additivity, and a h i g h e r i n t e r c e p t for n e g a t i v e i n s t a n c e s than positive.
In the h o l o g r a p h i c model of the t a s k ,
the locus of r e a c t i o n t i m e v a r i a t i o n is taken to be the d e p e n d e n c e of w a v e f r o n t d e t e c t i o n t i m e (tdo, tdr,
s e e F i g u r e 5) on w a v e f r o n t a m p l i t u d e .
The a m p l i t u d e of the s t o r a g e field w h i c h
was found f r o m n e u r o l o g i c a l d e r i v a t i o n s to be e x p o n e n t i a l l y r e l a t e d to N, the n u m b e r of i t e m s s t o r e d in m e m o r y .
A m a t h e m a t i c a l d e r i v a t i o n b a s e d on the e x p e r i m e n t a l l y o b s e r v e d
r e s p o n s e additivity a l s o s u p p o r t s the exponential r e l a t i o n , justifying the c o n c u r r e n c e model of n e u r a l change u s e d in t h i s p a p e r .
In addition, the additive effect of n o i s e on r e a c t i o n
38 t i m e ( S t e r n b e r g , 1967) l e a d s to the c o n c l u s i o n of a l o g a r i t h m i c I d e t e c t i o n function;
this
c o n c l u s i o n is c o n f i r m e d by the r e l a t i o n between s i m p l e R T and s t i m u l u s i n t e n s i t y ( 9 9 . 9 p e r cent of the v a r i a n c e of four s i m p l e RT s t u d i e s - - C a t t e l l , 1866; P i ~ r o n , 1920; B a r t l e t t and Macleod, 1954; Minueci and C o n n o r s , 1964--is a c c o u n t e d for by the l o g a r i t h m i c d e t e c t i o n function in c o m b i n a t i o n with a log e n e r g y t r a n s f o r m at the r e c e p t o r - - H a r t l i n e and G r a h a m , 1932).
The c o n c a t e n a t i o n of the l o g a r i t h m i c d e t e c t i o n t i m e vs. a m p l i t u d e r e l a t i o n and the
exponential a m p l i t u d e vs. N r e l a t i o n p r e d i c t s that r e a c t i o n t i m e i s a l i n e a r function of the n u m b e r of i t e m s m e m o r i z e d and t h a t the slope of the function is the s a m e for p o s i t i v e and n e g a t i v e r e s p o n s e s with p o s i t i v e s b e i n g u n i f o r m l y f a s t e r than n e g a t i v e s .
Furthermore,
the
a s s u m p t i o n t h a t the b r a i n o p t i m i z e s its p r o c e s s i n g c a p a c i t y p e r m i t s the slope of the R T function to be e x p r e s s e d in t e r m s of the m e m o r y span for the type of m a t e r i a l b e i n g t e s t e d . Data f r o m the m e m o r y span and m e m o r y s e a r c h l i t e r a t u r e s u p p o r t e d the p r e d i c t e d r e c i p r o cal r e l a t i o n between span a n d p r o c e s s i n g r a t e (Cavanagh, in p r e s s ) . T h u s , on the b e h a v i o r a l level, the h o l o g r a p h i c h y p o t h e s i s is s u p p o r t e d without exception on a v a r i e t y of m e a s u r e s .
I n v e s t i g a t i o n of the n e u r a l h o l o g r a p h i c p r o c e s s is u n -
d e r w a y at p r e s e n t on t h r e e additional l e v e l s : the p o s s i b i l i t y of long t e r m m e m o r y b a s e d on phase holography o r a t w o - s t a g e " b l e a c h e d " t r a n s m i s s i o n holography; single cell r e c o r d i n g s of the fatigue o r h a b i t u a t i o n of n e u r o n s to c o n f i r m the b e h a v i o r a l l y d e r i v e d exponential r e l a tion~ and, finally, the p r o p e r t i e s of c o m p l e x i n f o r m a t i o n p r o c e s s i n g s y s t e m s b a s e d on s t r u c t u r e s of i n t e r c o n n e c t e d h o l o g r a p h i c m e m o r i e s . Acknowledgments T h i s r e s e a r c h w a s s u p p o r t e d in p a r t by P u b l i c H e a l t h S e r v i c e R e s e a r c h G r a n t MH-07722 f r o m the National I n s t i t u t e of Mental Health. I a m v e r y t r a t e f u l to Dr. W i l l i a m Chase, J o h n P a r k m a n , Susan P e t e r s , and R i c h a r d Young for v a r i o u s c o m b i n a t i o n s of e m p e r i e a l , t h e o r e t i c a l , and s p i r i t u a l help and e s p e c i a l l y to Dr. T o m C a l v e r t for invaluable a s s i s t a n c e in developing the n e u r o p h y s i o l o g i c a l model reported here.
I The logarithmic detection is very significant from another viewpoint. The neural holographic system that has been described is linear in terms of mean rates; a fundamental characteristic of random (Poisson) spike trains is, however, that the variance of the spike rate is linearly related to the mean. Thus, while the amplitude description of a wavefront is invariant over different absolute levels of firing (e. g., at different base rates, which change as "r changes during storage, or different directions of change--increase or decrease), the variance in which the amplitude information is submerged is variable. The logarithmic function is the one function that transforms the dependence of the variance on the mean to an invariance. The detectability of wavefronts is thus independent of absolute firing levels only' in the case of logarithmic detection.
39 Reference s Baker, F . H . , E.R. Sanseverino, Y. Lamarre, and G. F. Poggio (1969), "Excitatory Responses of Geniculate Neurons of the Cat", J. Neurophysiology, 32_,_, 916-929. Bartlett, N.R. and S. Maeleod (1954), "Effect of Flash and Field Luminance Upon Human Reaction Time", J. Optical Soc. A m e r . , 4_~4, 306-311. Beurle, R.L. (1956), "Properties of a Mass of Cells Capable of Regenerating Pulses", Philos. Trans. Royal Soc. London, Series B, 24___00,55-94. Bracey, G.W. (1969), "Two Operations in Character Recognition: A Partial Replication", Perception and Psychophysics, 6, 357-360. Cattell, J. McK. (1886), "The Influence of the Intensity of the Stimulus on the Length of the Reaction Time", Brain, 9, 512-515. Cavanagh, J . P . (1972), "Holographic Processes Realizable in the Neural Realm: Prediction of Short Term Memory Performance", Unpublished doctoral dissertation, CarnegieMellon University. Cavanagh, J . P . (in press), "The Relation Between Memory Span and Memory Search Rate", Psychological Rev,, to appear. Collier, R.J. and K.S. Pennington (1967), "Multicolor Imaging from Holograms Formed on Two-dimensional Media", Appl. Optics, 6_., 1091-1095. Creutzfeldt, O.D. (1970), "Some Principles of Synaptic Organization in the Visual System", in Francis O. Schmitt (Ed.), The Neurosciences, Second Study Program (New York: Rockerfeller University Press). DeValois, R . L . , G.H. Jacobs, and A.E. Jones (t962), "Effects of Increments and Decrements of Light on Neural Discharge Rate", Science., i36___,986-98d. Enger, P . S . , J.K.S. Jansen, and L. Wall~e (1969), "A Biological Model of the Excitation of a Second Order Sensory Neurone", Kybernetik, 6, 141-145. F r i e s e m , A.A, and J.S. Zetenka (1967), "Effects of Film Nonlinearities in Holography", Appl. Optics, 6, 1755-1759. Gabor, D.A. (1945), "A New Microscopic Principle", Nature, 16__~.1,777. Ginsburg, A . P . (1970, "Psychological Correlates of a Model of the Human Visual S stem", Unpublished m a s t e r ' s thesis, Air Force Institute of Technology, Wright-Patterson Air Force Base, Ohio. Griffiths, J.S. (1966), "A Theory of the Nature of Memory", Nature, ~
1160-1±63.
Hartline, H.K. and C.H. Graham (1932), "Nerve Impulses from Single Receptors in the Eye", J. Cellular and Comparative Physiology, t_.., 277-295. Hebb, D.O. (1949), Organization of Behavior (New York: Wiley). Julesz, B. and K.S. Pennington (1965), "Equidistributed Information Mapping: An Analogy to Holograms and Memory ~', J. Optical See. A m e r . , 55__, 604. Kabrisky, M., C.F. Hall, L. Goble, R.A. Gill, and J.W. Carl (1970, "Realization of a Data Independent Pattern Recognition System", Annual Symposium Record, Systems, Man, and Cybernetics, I . E . E . E . , 233-240. Kupfermann, I. and H. Pinsker (1969), "Plasticity in Aptysia Neurons and Some Simple Neuronal Models of Learning", in Jack T. Tapp (Ed.), Reinforcement and Behavior (New York: Academic Press).
40
Lashley, K.S. (1929), Brain Mechanisms and Intelligence (Chicago: University of Chicago Press). Latour, P.L. (1967), "Evidence of Internal Clocks in the Human 10glen , 2__77,341-348.
Operator",
Acta Psycho-
Minueci, P.K. and M.M. Conners (1964), "Reaction Time Under Three Viewing Conditions: Binocular, Dominant Eye, and Nondominant Eye", J. Experimental psychology, 6_%7, 268-275. Perkel, D.H. and T.H. Bullock (1968), "Neural Coding", Neurosciences Bulletin, 6, 221-348.
Research
Program
Perkel, D.H., J. Schulman, T.H. Bullock, G.P. Moore, and J.P. Segundo (±964), "Pacemaker Neurons: Effects of Regularly Spaced Synaptie Input", Science, !45, 61-63. .I
Proton, H. (1920), "Nouvelles r~cherches sur l'analyse due temps de faience sensorielle et sur la loi qui relie ce temps }t l'intensite de l'excitation", Annie Psyehologique , 2_22, 58-142. PSppel, E. (1970), "Excitability Cycles in Centra[ Intermittency",
A, 3
Psyehologische
Forschun~
~-9.
Pribram, K.H. (1966), "Some Dimensions of Remembering: Steps Toward a Neuropsychological Model of Memory", in John Gaito (Ed.), Macromolecuies and Behavior, (New York: Appleton-Century-Crofts). Pribram, K.H. (1969), "The Neurophysiology 73-86. Pribram,
K.H.
(1971), Languages
of Remembering",
of the Brain (Englewood
Scientific American,
220,
Cliffs, N.J. : Prentice-Hall).
Segundo, J.P., D.H. Perkel, H. Wyman, H. Hegstad and G.P. Moore (1968), "Input-Output Relations in Computer-Simulated Nerve Ceils. Influence of the Statistical Properties, Strength, Number, and Interdependence of Excitatory Presynaptic Terminals", Kybernetik , _4, 157-171.
Sharpless, S.K. (1964), "Reorganization of Function in the Nervous System--Use and Disuse", in Victor E. Hall (Ed.), Annual Review of Physiology, 26_,_2,357-388. Sternberg, S. (t966), "High-speed Scanning in Human Memory", Science, 153, 652-654. Sternberg, S. (1967), "Two Operations in Character Recognition: Some Evidence from Reaction-time Measurements", Perception and Psychophysics, 2_, 45-53. Tokarski, J . M . J . (1968), "The Effect on the Hologram Record of a Nonlinear Relationship Between Amplitude T r a n s m i s s and Exposure", Appt. Optics, 7, 989-990. Upataieks~ J. and C.D. Leonard (1970), " C h a r a c t e r i s t i c s of Dielectric Holograms", I . B . M . J. Research and Development, 1_.~4,527-532. vanHeerden, P . J . (1963), "Theory of Optical Information Storage in Solids", AppI. Optics, 2, 393-400. Westlake, P.R. (1967), "Towards a Theory of Brain Functioning: The Possibilities of Neural Holographic Processes", Conference Proceedings of the 20th Annual Conference on Engineering in Medicine and Biology , I, E. E. E. Westlake, P.R. (1968), "Towards a Theory of Brain Functioning: A Detailed Investigation of the Possibilities of Neural Holographic Processes", Doctoral dissertation, University of California, Los Angeles (Ann Arbor, Michigan: University Microfilms; No. 68-12477). Westlake, P.R. (1970),"The Possibility of Neural Holographic Kyberuetik, 7, 129-153.
Processes Within the Brain",
SEMANTIC MEMORY R E T R I E V A L : SOME DATA AND A MODEL E l i z a b e t h F. Loftus U n i v e r s i t y of W a s h i n g t o n Introduction If I w e r e to a s k the a v e r a g e E n g l i s h - s p e a k i n g adult to n a m e an a n i m a l , o r a yellow f r u i t , o r a flower beginning with the l e t t e r " D " , he would o r d i n a r i l y be able to give m e a c o r r e c t a n s w e r in l e s s t h a n a few s e c o n d s .
P r o d u c i n g a piece of i n f o r m a t i o n t h a t one h a s
l e a r n e d s o m e t i m e ago and knows v e r y well r e q u i r e s v e r y l i t t l e e f f o r t indeed. we do i t ?
But, how do
By what p r o c e s s do we r e a c h into the huge s t o r e of i n f o r m a t i o n in m e m o r y and
produce a r e s p o n s e t h a t i s a p p r o p r i a t e to a given q u e s t i o n .
T h e r e i s no doubt t h a t we a r e
v e r y good a t doing t h i s , but at the m o m e n t we know r e l a t i v e l y l i t t l e about how we do it. Although it is too e a r l y to p r o v i d e d e t a i l s of the r e t r i e v a l m e c h a n i s m , we c a n m a k e c e r t a i n g e n e r a l d i s t i n c t i o n s a m o n g p o s s i b l e types of p r o c e s s e s .
F o r e x a m p l e , we can c l a s -
sify p r o c e s s e s of m e m o r y - a c c e s s in t e r m s of the e x t e n t to w h i c h they involve s u c c e s s i v e a s opposed to s i m u l t a n e o u s c o n s u l t i n g of the m e m o r y s t o r e .
This basic distinction has many
i m p o r t a n t c o n s e q u e n c e s : one of t h e m c o n c e r n s the effect of s i z e of the a r r a y to be s e a r c h e d on s e a r c h i n g t i m e .
To the e x t e n t t h a t the r e t r i e v a l p r o c e s s i n v o l v e s s u c c e s s i v e c o n s u l t a t i o n
of the m e m o r y s t o r e , r e t r i e v a l t i m e should be a function of the m e m b e r of i t e m s in the a r r a y to be s e a r c h e d .
C o n v e r s e l y , to the e x t e n t t h a t s i m u l t a n e o u s c o n s u l t a t i o n ( o r " p a r a l l e l
p r o c e s s i n g " ) i s involved, r e t r i e v a l t i m e should be r e l a t i v e l y unaffected by the n u m b e r of i t e m s in the a r r a y . Previous Research In m o s t of the e a r l i e r r e s e a r c h dealing with the e f f e c t of a r r a y o r c a t e g o r y size on r e t r i e v a l t i m e , s u b j e c t s have been given a r e c o g n i t i o n o r i d e n t i f i c a t i o n t a s k .
Typically they
m u s t decide w h e t h e r a g i v e n i n s t a n c e i s a m e m b e r of a p a r t i c u l a r a r r a y , c l a s s o r c a t e g o r y . Most of t h i s w o r k h a s d e a l t with r e l a t i v e l y s m a l l , newly l e a r n e d c a t e g o r i e s t h a t a r e t y p i c a l l y defined s o l e l y by an e n u m e r a t i o n of i n s t a n c e s (e. g . , N e i s s e r , 1963; P o l l a c k , 1963; R a b b i t t , 1959; S t e r n b e r g , 1966).
F o r e x a m p l e , S t e r n b e r g ( 1 9 6 6 ) gave s u b j e c t s a g r o u p of d i g i t s (e. g . ,
4, 8, 3, 5) and a s k e d t h e m w h e t h e r a n o t h e r digit (e. g . , 3) was a m e m b e r of t h a t set.
This
r e s e a r c h on " s h o r t - t e r m m e m o r y " h a s g e n e r a l l y found r e s p o n s e t i m e for b o t h p o s i t i v e a n d n e g a t i v e i n s t a n c e s to be a d i r e c t function of the size of the c a t e g o r y .
This result has been
i n t e r p r e t e d a s e v i d e n c e for the e x i s t e n c e of a s u c c e s s i v e and p e r h a p s e v e n e x h a u s t i v e s c a n ning process for retrieval from short-term memory. W h a t happens when l a r g e r and b e t t e r - l e a r n e d c a t e g o r i e s a r e u s e d ?
For example,
suppose we a s k a s u b j e c t to decide w h e t h e r a "dog" i s a n " a n i m a l " ? L a n d a u e r and F r e e d m a n
42
(1963) found that s u b j e c t s took l o n g e r to decide that an i t e m was not a m e m b e r of a l a r g e c a t e g o r y than to decide that it was not a m e m b e r of a s m a l l c a t e g o r y .
F o r e x a m p l e , it took
l o n g e r to decide that a " d e s k " was not an " a n i m a l " than to decide that it was not a "dog". T h e r e was a slight, but n o n s i g n i f i c a n t , d i f f e r e n c e in d e c i s i o n t i m e s for the p o s i t i v e i n s t a n c e s . Collins and Quillian (1969) and M e y e r (1970), using s o m e w h a t d i f f e r e n t p r o c e d u r e s , a l s o r e p o r t that r e t r i e v a l t a k e s l o n g e r for l a r g e r c a t e g o r i e s . Although L a n d a u e r and F r e e d m a n , Collins and Quillian~ and M e y e r all find an e f f e c t of c a t e g o r y s i z e , the e f f e c t is v e r y s m a l l r e l a t i v e to the s i z e of the c a t e g o r i e s u s e d .
For
e x a m p l e , L a n d a u e r and F r e e d m a n r e p o r t that the c o r r e c t identification of n e g a t i v e i n s t a n c e s took 53 m s e c . l o n g e r for l a r g e than f o r s m a l l c a t e g o r i e s .
arrays to be searched,
in order for such small differences to be caused
time it takes to scan the larger categories, mously
Given the r e l a t i v e s i z e of the
rapid, on the order of 1,000 words
the successive
by the additional
scanning would have to be enor-
per sec., which seems
improbable.
The authors
accordingly conclude that the small differences should probably not be interpreted as evidence for the existence of a successive scanning process. some
Thus,
effect of category size on retrieval from semantic
been interpreted in terms of successive processing. small that they seem processing of some
to argue
for a mechanism
previous research
memory,
has sho~a
but it has generally not
On the contrary,
the differences are so
consisting largely if not entirely of parallel
sort.
The Original Experiment In 1969 I conducted an experiment Freedman
at Stanford University.
on this problem
in collaboration with Jonathan
Since subsequent experiments
have used a semilar meth-
odology, and have in general been designed to test a model of retrieval that we proposed the publication growing out of that research
(Freedman
to describe the original experiment
detail.
The experiment mechanism
was designed to provide more
with particular emphasis
sing is involved.
in some
to decide whether
memory
information about the retrieval
One major departure from previous work is that rather than study identifi-
ject could actually produce a word himself,
it is simple,
1971), it is appropriate
on the question of the extent to which successive proces-
cation time as had been done before, this experiment
duce a member
and Loftus,
in
it was a member
concerned
the speed with which a sub-
Instead of giving him a stimulus and asking him
of a category,
of it. The identification procedure
he was given a category and asked to prohas been used in the past largely because
convenient and yet obviously involves the retrieval of information from the
store.
The production procedure
is more
complicated
and less convenient because
|n a sense it involves a higher level of retrieval--the individual must not only reach into the store and find information relating to a stimulus,
he must actually produce an item from that
43 store.
D e s p i t e its d i f f i c u l t i e s , the use of t h i s p r o c e d u r e s e e m e d to be j u s t i f i e d b e c a u s e it is
an i m p o r t a n t f o r m of r e t r i e v a l a n d p r o v i d e s additional i n f o r m a t i o n about the r e t r i e v a l p r o c e s s . The b a s i c p r o c e d u r e was to p r e s e n t the s u b j e c t with a s t i m u l u s c o n s i s t i n g of a noun c a t e g o r y p a i r e d with e i t h e r a l e t t e r o r an a d j e c t i v e , and a s k h i m to p r o v i d e a w o r d t h a t b e longed in the o v e r l a p defined by the p a i r .
F o r e x a m p l e , s u b j e c t s who w e r e p r e s e n t e d with
the p a i r " f r u i t - P " m i g h t s a y " p e a c h " , " p e a r " , o r " p l u m " , a m o n g o t h e r p o s s i b i l i t i e s .
A
c o r r e c t r e s p o n s e would be any word b e g i n n i n g w i t h " P " t h a t n a m e s a kind of fruit. R e s p o n s e s s u c h a s " a p p l e " o r "pony" would be i n c o r r e c t . As d e s c r i b e d above, the m a i n focus of the study was on the e x t e n t to w h i c h the r e t r i e v a l m e c h a n i s m involved s u c c e s s i v e scanning.
The effect of size of the a r r a y to be
s e a r c h e d on r e t r i e v a l t i m e was an i n d i c a t i o n of the p r e s e n c e o r a b s e n c e of s u c c e s s i v e p r o c e s sing.
The e f f e c t of a r r a y size w a s i n v e s t i g a t e d by s e l e c t i n g m a n y noun c a t e g o r i e s t h a t r a n g e d
in s i z e f r o m v e r y s m a l l (e. g . , s e a s o n s , gems) to e x t r e m e l y l a r g e (words, f i r s t n a m e s ) . A n o t h e r c o n s e q u e n c e of s u c c e s s i v e p r o c e s s i n g c o n c e r n s the effect of the a r r a y defined by the o v e r l a p of the noun c a t e g o r y with the a d j e c t i v e or l e t t e r r e s t r i c t o r , o r e q u i v a l e n t l y , the n u m b e r of p o s s i b l e c o r r e c t r e s p o n s e s .
The s i z e of the o v e r l a p v a r i e d f r o m a m i n i m u m
of one ( " a n i m a l - Z " , with " z e b r a " b e i n g the only c o r r e c t r e s p o n s e in m o s t p e o p l e ' s m e m o r y s t o r e ) to v e r y l a r g e ( " f i r s t n a m e - J " , with dozens of n a m e s being p o s s i b l e r e s p o n s e s ) .
To
the e x t e n t t h a t s u c c e s s i v e s c a n n i n g plays a r o l e in r e t r i e v a l , it s e e m s l i k e l y t h a t the l a r g e r the n u m b e r of p o s s i b l e r e s p o n s e s , the s o o n e r a s u b j e c t will find and p r o d u c e one. The study thus p r o v i d e s two ways of a s s e s s i n g the e x t e n t to w h i c h s u c c e s s i v e s c a n n i n g o c c u r s in the r e t r i e v a l p r o c e s s : the effect of s i z e of the c a t e g o r y on r e a c t i o n t i m e a n d the e f f e c t of o v e r l a p of the c a t e g o r y a n d m o d i f i e r on r e a c t i o n t i m e . Method F o r t y s u b j e c t s w e r e individually told t h a t we w e r e conducting a study of how m e m o r y worked, t h a t they would s e e i t e m s c o n s i s t i n g of c a t e g o r i e s and e i t h e r a d j e c t i v e s o r l e t t e r s , and t h a t they should r e s p o n d with a w o r d that was an a p p r o p r i a t e m e m b e r of the c a t e g o r y . They w e r e given e x a m p l e s , and told to r e s p o n d a s quickly a s p o s s i b l e , but to avoid e r r o r s . D u r i n g the e x p e r i m e n t , the s u b j e c t s a t in f r o n t of a s c r e e n in w h i c h w a s a window c o v e r e d by h a l f - s i l v e r e d g l a s s .
An index c a r d c o n t a i n i n g the s t i m u l u s w a s p l a c e d in a d a r k
e n c l o s u r e behind the m i r r o r and was p r e s e n t e d by i l l u m i n a t i n g the e n c l o s u r e .
A microphone
was p l a c e d in f r o n t of the s u b j e c t a n d he r e s p o n d e d by s p e a k i n g into it. A t r i a l c o n s i s t e d of the following.
As a c a r d with t h e i t e m p r i n t e d in l a r g e type was
p l a c e d in the d a r k e n e d e n c l o s u r e behind t h e h a l f - s i l v e r e d m i r r o r , t h e e x p e r i m e n t e r s a i d " R e a d y " , a n d p r e s s e d a button t h a t i l l u m i n a t e d the f i r s t m e m b e r of the s t i m u l u s p a i r .
After
a n i n t e r v a l of a t l e a s t . 5 s e c . , the second m e m b e r of the s t i m u l u s p a i r w a s a u t o m a t i c a l l y
44 illuminated, and s i m u l t a n e o u s l y an e l e c t r i c t i m e r with a DC clutch was s t a r t e d .
The s u b -
j e c t ' s v e r b a l r e s p o n s e a c t i v a t e d a voice key that stopped the clock and t e r m i n a t e d the t r i a l . E a c h s u b j e c t r e c e i v e d a r a n d o m s e q u e n c e of 96 s t i m u l i with the c a t e g o r y p r e c e d i n g the r e s t r i c t e r on half the t r i a l s and following it on the o t h e r half. Results The two r e s u l t s that b e a r on the s u c c e s s i v e s c a n n i n g i s s u e a s a s follows. 1) T h e r e was a n o n s i g n i f i c a n t c o r r e l a t i o n of -. 22 between c a t e g o r y s i z e and r e a c t i o n t i m e . Thus, c o n t r a r y to e x p e c t a t i o n s f r o m a s u c c e s s i v e scanning model, the amount of t i m e to r e t r i e v e a w o r d f r o m a l a r g e c a t e g o r y i s not g r e a t e r than for a s m a l l c a t e g o r y - - r a t h e r t h e r e is little r e l a t i o n s h i p b e t w e e n s i z e and l a t e n c y and what t h e r e is i n d i c a t e s that l a r g e r c a t e g o r i e s take l e s s t i m e than s m a l l c a t e g o r i e s . 2) T h e r e was a n o n s i g n i f i c a n t c o r r e l a t i o n of . 02 b e t w e e n the n u m b e r of p o s s i b l e c o r r e c t r e s p o n s e s and r e a c t i o n time~ a l s o c o n t r a r y to e x p e c t a t i o n s f r o m a s u c c e s s i v e s c a n n i n g model. Although size of c a t e g o r y and o v e r l a p do not affect r e a c t i o n t i m e , o t h e r v a r i a b l e s do. 1) R e c a l l t h a t e a c h s t i m u l u s c o n s i s t e d of a noun and e i t h e r a l e t t e r o r an a d j e c t i v e ; and that the noun c a m e e i t h e r f i r s t o r s e c o n d . R e a c t i o n t i m e was significantly f a s t e r when the noun c a m e f i r s t r a t h e r than s e c o n d (1.87 vs. 2.12 s e c . ) .
R e a c t i o n t i m e w a s a l s o significantly f a s -
t e r when the s t i m u l u s included an adjective r a t h e r than a l e t t e r ( 1 . 8 4 v s . 2.15 s e c . ) . 2) A s e c o n d v a r i a b l e involves the f r e q u e n c y in E n g l i s h of the p o s s i b l e c o r r e c t r e s p o n s e s . Specifically the f r e q u e n c y in E n g l i s h of the one c o r r e c t r e s p o n s e that had the h i g h e s t such f r e quency w a s r e l a t e d to r e a c t i o n t i m e . have f a s t e r r e a c t i o n t i m e s .
Stimuli that have h i g h e r f r e q u e n c y r e s p o n s e s tend to
This finding i s a f u r t h e r d e m o n s t r a t i o n of the f r e q u e n c y - r e a c t i o n
t i m e r e l a t i o n s h i p found by M a r b e quite long ago (Thumb and M a r b e , 1901; c i t e d in Woodworth and S c h l o s b e r g , 1954). 3) A n o t h e r i m p o r t a n t v a r i a b l e involves the likelihood that a p a r t i c u l a r r e s p o n s e will be given when s u b j e c t s a r e a s k e d to n a m e w o r d s that fit a p a r t i c u l a r c a t e g o r y . n a n c e " of a r e s p o n s e within a c a t e g o r y .
We call this the " d o m i -
R a t h e r than the f r e q u e n c y in the E n g l i s h language in
g e n e r a l , " d o m i n a n c e " r e f e r s to the f r e q u e n c y with which a w o r d i s given a s an e x a m p l e of a category.
I n f o r m a t i o n on dominance was obtained f r o m Battig and Montague (1969).
c l e a r that high dominance p r o d u c e s f a s t e r r e a c t i o n t i m e s .
It is
Within the " f r u i t " category~ for
e x a m p l e , "apple" i s m o r e d o m i n a n t than " l e m o n " ; thus t h e r e i s a t e n d e n c y to r e s p o n d to " f r u i t - A " m o r e quickly than to f r u i t - L " . Discussion The m a j o r focus of this study was the question of w h e t h e r the p r o c e s s of r e t r i e v a l f r o m s e m a n t i c m e m o r y involved s u c c e s s i v e scanning to any a p p r e c i a b l e e x t e n t .
To the d e g r e e that
45 s u c c e s s i v e s c a n n i n g of i t e m s in the m e m o r y s t o r e o c c u r s , r e a c t i o n t i m e should be l o n g e r when m o r e i t e m s have to be s c a n n e d .
When a s u b j e c t is a s k e d to p r o d u c e an i t e m f r o m an
a r r a y o r c a t e g o r y , the l a r g e r the c a t e g o r y , the l o n g e r the r e a c t i o n t i m e should be.
T h u s , if
r e a c t i o n t i m e s a r e l o n g e r f o r l a r g e r c a t e g o r i e s , it s u g g e s t s t h a t s u c c e s s i v e s c a n n i n g i s o c c u r r i n g ; if r e a c t i o n t i m e s a r e not l o n g e r for l a r g e r c a t e g o r i e s , i t s u g g e s t s t h a t s u c c e s s i v e s c a n n i n g i s not o c c u r r i n g .
The p r e s e n t study did not find a p o s i t i v e r e l a t i o n s h i p between
c a t e g o r y s i z e and r e a c t i o n t i m e .
F u r t h e r m o r e , to the e x t e n t t h a t s u c c e s s i v e s c a n n i n g plays
a r o l e in r e t r i e v a l , r e a c t i o n t i m e should b e s h o r t e r when t h e r e a r e a l a r g e n u m b e r of p o s s i b l e c o r r e c t r e s p o n s e s (the m o r e c o r r e c t r e s p o n s e s , the e a s i e r it should be to find one). The p r e s e n t study did not find a n e g a t i v e r e l a t i o n s h i p b e t w e e n the n u m b e r of p o s s i b l e e o r r e e t r e s p o n s e s and r e a c t i o n t i m e .
T h u s , all of the e v i d e n c e i n d i c a t e s t h a t the p r o c e s s of r e t r i e v a l
i n v o l v e s l i t t l e o r no s u c c e s s i v e s c a n n i n g of the m e m o r y s t o r e . We m i g h t m e n t i o n a t t h i s point t h a t the i t e m s b e i n g r e t r i e v e d w e r e e x t r e m e l y w e l l learned.
It m a y well be t h a t with r e l a t i v e l y o b s c u r e i t e m s , o r with e a s y i t e m s t h a t for s o m e
reason are
not found quickly, a s u b j e c t e v e n t u a l l y r e s o r t s to s u c c e s s i v e s c a n n i n g .
However,
it a p p e a r s t h a t with t h e s e o v e r l y - l e a r n e d i t e m s , the n o r m a l , s u c c e s s f u l p r o c e s s of r e t r i e v a l does not involve s u e e e s s i v e s c a n n i n g of the m e m o r y s t o r e . A R e t r i e v a l Model If the r e t r i e v a l p r o c e s s d o e s not involve s u c c e s s i v e s c a n n i n g , of w h a t does it c o n s i s t ? One m o d e l t h a t a p p e a r s to fit m u c h of the data i n v o l v e s a h i e r a r c h i c a l o r g a n i z a t i o n , b y w h i c h we m e a n a s y s t e m t h a t is divided into a n u m b e r of i n t e r c o n n e c t e d s u b s y s t e m s , e a c h of the latter being hierarchical itself.
Specifically, o u r b a s i c conception i s t h a t of a m e m o r y o r g a n -
ized into a c o m p l e x h i e r a r c h y c o m p o s e d of c a t e g o r i e s (e. g . , a n i m a l s ) with s u b s e t s of e a c h (e. g . , b i r d s , dogs) and s u p e r s e t s (e. g . , l i v i n g things).
The s e a r e h p r o c e s s n e e d not b e g i n
a t the top and w o r k down until the a p p r o p r i a t e s u b s e t is found ( a s s u g g e s t e d , for e x a m p l e , by G r e e n , e t a l . , 1963 a n d L i n d s a y , 1963). can be e n t e r e d d i r e c t l y .
R a t h e r , e a c h c a t e g o r y h e a d s i t s own h i e r a r c h y t h a t
T h u s , to find a b i r d the c a t e g o r y " b i r d s " i s e n t e r e d ; to find a n a n i -
m a l , the c a t e g o r y " a n i m a l s " i s e n t e r e d ; and so on. In o r d e r to explain the l a c k of e f f e c t of c a t e g o r y s i z e , additional a s s u m p t i o n s a r e necessary.
Within e a c h c a t e g o r y it s e e m s l i k e l y t h a t a v a r i e t y of s u b s e t s e x i s t .
Some a r e
noun c a t e g o r i e s t h a t a r e s p e c i a l i z e d m e m b e r s of the l a r g e r s e t (e. g . , b i r d s and dogs a r e s u b s e t s of a n i m a l s ) . b e r of r e a s o n s .
Some a r e c l u s t e r s of w o r d s t h a t a r e highly a s s o c i a t e d for any of a n u m -
T h e y m a y have q u a l i t i e s in c o m m o n (e. g . , a l l begin with the l e t t e r " S " o r
all have long n a m e s o r all r h y m e ) .
They m a y be a s s o c i a t e d with e a c h o t h e r in the i n d i v i d u a l ' s
e x p e r i e n c e (e. g . , all be a n i m a l s in the P o o h books).
These clusters are probably more
i d i o s y n c r a t i c than the m a i n , noun c a t e g o r i e s , but a r e s o m e w h a t c o n s i s t e n t a c r o s s i n d i v i d u a l s .
46 And finally, u n d e r e a c h c a t e g o r y i s an u n d i f f e r e n t i a t e d e n u m e r a t i o n of e x e m p l a r s .
Within all
s u b s e t s , c l u s t e r s and the e n u m e r a t i o n , the i n s t a n c e s will be l i s t e d in a m o r e o r l e s s c o n s t a n t o r d e r , a c c o r d i n g to t h e i r f r e q u e n c y in the language o r d o m i n a n c e in the c a t e g o r y . U s i n g t h i s as a g e n e r a l m o d e l , we c a n begin to d e s c r i b e how a p e r s o n m a n a g e s the t a s k t h a t he h a s b e e n g i v e n i n t h e a b o v e e x p e r i m e n t . ginning with the l e t t e r " P " .
He m u s t , f o r e x a m p l e , find a f r u i t b e -
It s e e m s r e a s o n a b l e to a s s u m e t h a t the p r o c e s s of r e t r i e v a l h a s
a t l e a s t two m a j o r s t e p s : 1) e n t e r i n g an a p p r o p r i a t e c a t e g o r y - - " f r u i t s " ; and 2) finding an a p p r o p r i a t e m e m b e r of t h a t e a t e g o r y - - " p e a c h " (plus, of c o u r s e , the t i m e r e q u i r e d to p r o duce the r e s p o n s e v e r b a l l y ) .
T h e s e two s t e p s m a y e a c h be divided into s u b s t e p s , but for the
m o m e n t we have no i n f o r m a t i o n on t h a t . It c a n be s e e n t h a t nothing in the model would i m p l y t h a t r e t r i e v M would take l o n g e r for l a r g e r c a t e g o r i e s .
Step 1 i s a s s u m e d to be equally e a s y for l a r g e and s m a l l c a t e g o r i e s ,
s i n c e the p a r t i c u l a r c a t e g o r y is e n t e r e d d i r e c t l y . step 2 need not be affected by c a t e g o r y s i z e . the c a t e g o r y that fits the r e s t r i c t i o n i m p o s e d .
S i m i l a r l y , but s o m e w h a t l e s s obviously,
The c r u c i a l p r o b l e m is finding an i n s t a n c e of Once the c a t e g o r y is e n t e r e d , the next s t e p
( p r e s u m a b l y a substep) is to find an a p p r o p r i a t e c l u s t e r of i t e m s .
U n d e r f r u i t , a c l u s t e r of
" f r u i t s b e g i n n i n g with P " e x i s t s , is e n t e r e d , and the f i r s t e n t r y is r e a d out.
If i n s t e a d the
t a s k w e r e to find a g e m whose c o l o r was g r e e n , the s m a l l e r s e t " g e m s " would be e n t e r e d d i r e c t l y , the s u b s e t " g r e e n g e m s " found a n d the f i r s t e n t r y r e a d out, a huge s e t with a huge s u b s e t , the s a m e p r o c e s s i s r e p e a t e d .
And to find " N o u n - Y " ,
In all c a s e s , it c o n s i s t s of
finding a m a i n s e t and a s u b s e t , and does not involve s e a r c h i n g t h r o u g h au a r r a y of i n s t a n c e s . T h i s m o d e l of the r e t r i e v a l p r o c e s s a c c o u n t s f o r the l a c k of effect of c a t e g o r y s i z e , and, it s e e m s to us, is quite p l a u s i b l e . c l u s t e r s exist.
It s e e m s unlikely t h a t e v e r y c a t e g o r y c o n t a i n s s e p a r a t e c l u s t e r s for e a c h
l e t t e r and a d j e c t i v e . clusters.
The one i m p l a u s i b i l i t y i s the notion t h a t so m a n y
However, t h e r e a r e two a r g u m e n t s in f a v o r of the e x i s t e n c e of s u c h
F i r s t , when a s u b j e c t i s a s k e d to n a m e s e v e r a l f r u i t s b e g i n n i n g with a p a r t i c u l a r
l e t t e r , he h a s l i t t l e difficulty in p r o d u c i n g m a n y c o r r e c t r e s p o n s e s , v e r y r a p i d l y (if, in fact, m a n y c o m m o n r e s p o n s e s exist). p a u s e and then say " p l u m " .
T h a t is, he does not s a y " p e a c h " , p a u s e and then say " p e a r "
The typical p a t t e r n we have found in i n f o r m a l t e s t i n g i s a s p u r t
of s e v e r a l r e s p o n s e s , p e r h a p s followed by a p a u s e and then s e v e r a l m o r e r e s p o n s e s , etc. This s u g g e s t s t h a t t h e s e w o r d s a r e c l u s t e r e d in s o m e s o r t of functional r e l a t i o n s h i p .
The
s e c o n d a r g u m e n t in f a v o r of t h e e x i s t e n c e of c l u s t e r s is t h a t when m u l t i d i m e n s i o n a l s c a l i n g and c l u s t e r i n g p r o c e d u r e s a r e applied to c a t e g o r y r e t r i e v a l data, c e r t a i n c a t e g o r y m e m b e r s t h a t have q u a l i t i e s in c o m m o n tend to c l u s t e r t o g e t h e r (Shepard, 1972). In t h i s model, we have m a d e the a s s u m p t i o n t h a t the m e m o r y s t o r e is o r g a n i z e d p r i m a r i l y into noun c a t e g o r i e s .
It a l m o s t c e r t a i n l y i n c l u d e s g r o u p s of i t e m s t h a t have q u a l i -
47 t i e s in c o m m o n (e. g . , w a r m , r e d , e t e . ) and mac- e v e n have g r o u p s that have initial l e t t e r s in c o m m o n (e. g . , all w o r d s s t a r t i n g with P).
In fact, we can handle the fact that r e t r i e v a l
t i m e is f a s t e r when a noun is p a i r e d with an adjective r a t h e r than a l e t t e r by postulating that the main c l u s t e r s a r e i t e m s that have q u a l i t i e s in c o m m o n and within t h e s e c l u s t e r s a r e groupings of i t e m s that have initial l e t t e r s in c o m m o n .
The m a j o r , useful o r g a n i z a t i o n ,
h o w e v e r , is thought to be in t e r m s of noun g r o u p i n g s .
The significance of t h i s a s s u m p t i o n
i s that the f i r s t s t e p of the r e t r i e v a l p r o c e s s would c o n s i s t of locating and e n t e r i n g the a p p r o p r i a t e noun c a t e g o r y .
The p r e s e n t e x p e r i m e n t p r o v i d e s s o m e data that a r e c o n s i s t e n t with
this model and that provide an e s t i m a t e of the duration of the f i r s t s t e p in the p r o c e s s . E a c h s t i m u l u s p a i r was p r e s e n t e d with the noun e i t h e r f i r s t o r s e c o n d . When the noun c o m e s s e c o n d , the total r e t r i e v a l p r o c e s s begins only a f t e r its p r e s e n t a t i o n . When the noun c o m e s f i r s t , s t e p 1 can be begun b e f o r e the s e c o n d half of the p a i r , any d i f f e r e n c e due to o r d e r can be a s s u m e d to be c a u s e d by that p a r t of the p r o c e s s that i s c o m p l e t e d b e f o r e the s e c o n d half i s shown.
Thus, the d i f f e r e n c e b e t w e e n noun f i r s t and noun s e c o n d i s an i n d i c a -
tion of the e x i s t e n c e of s t e p 1 and of its duration. When nouns a r e p r e s e n t e d f i r s t , the m e a n r e a c t i o n t i m e is 1.87 s e c . , with noun second it i s 2.12 s e c . ditions.
T h i s d i f f e r e n c e of . 25 i s quite stable a c r o s s s o m e w h a t d i f f e r e n t c o n -
With n o u n - l e t t e r p a i r s , it i s . 27 s e c . ; with n o u n - a d j e c t i v e p a i r s it i s . 23 s e c .
T h e s e data s u p p o r t the idea that step 1 c o n s i s t s of e n t e r i n g the noun c a t e g o r y , and s u g g e s t that the duration of s t e p 1 is a p p r o x i m a t e l y . 25 s e c . f o r the p r o c e d u r e e m p l o y e d h e r e . To s u m m a r i z e , we have p r e s e n t e d a h i e r a r c h i c a l s t o r a g e m o d e l , and have p r o p o s e d that the r e t r i e v a l p r o c e s s f r o m s e m a n t i c m e m o r y c o n s i s t s of two d i s t i n c t s t e p s ( e n t e r i n g the a p p r o p r i a t e c a t e g o r y and then finding an a p p r o p r i a t e
m e m b e r of that c a t e g o r y ) .
This g e n e r -
al model is c o n s i s t e n t with the lack of r e l a t i o n s h i p b e t w e e n c a t e g o r y s i z e and r e t r i e v a l t i m e , and is given s o m e s u p p o r t by the d i f f e r e n c e in r e a c t i o n t i m e s when the noun is p r e s e n t e d f i r s t and second.
That d i f f e r e n c e o f . 25 s e c . a l s o s e r v e s a s an indication of the d u r a t i o n of s t e p
1 of the r e t r i e v a l p r o c e s s . E x p e r i m e n t a l Support for the Model Now let me p r e s e n t s o m e e v i d e n c e supporting t h r e e d i f f e r e n t a s p e c t s of the model. 1) The s e m a n t i c m e m o r y s t o r e i s o r g a n i z e d p r i m a r i l y into noun c a t e g o r i e s . The a s s u m p t i o n that the m a j o r o r g a n i z a t i o n i s in t e r m s of noun c a t e g o r i e s h a s s e v e r a l important implications.
One o b s e r v a b l e c o n s e q u e n c e c o n c e r n s the n u m b e r of w o r d s that a
s u b j e c t can produce in a given amount of t i m e u n d e r v a r i o u s c o n d i t i o n s . If we p r e s e n t a noun c a t e g o r y and give a s u b j e c t , say, one minute to w r i t e down any i t e m s that belong in the c a t e gory, he should be able to produce m o r e i t e m s than if we p r e s e n t him with an adjective and ask him to w r i t e any i t e m s w h i c h have the i n h e r e n t quality of that a d j e c t i v e .
A c c o r d i n g to the
48 model~ when a s u b j e c t i s p r e s e n t e d with a noun c a t e g o r y , he e n t e r s that c a t e g o r y in his s e m a n t i c m e m o r y and begins to n a m e m e m b e r s of the c a t e g o r y that a r e s t o r e d t h e r e .
When
he s e e s an a d j e c t i v e , h o w e v e r , he m u s t s t i l l e n t e r the m e m o r y s t o r e at s o m e noun c a t e g o r y , w h e r e u p o n he can n a m e m e m b e r s of that c a t e g o r y which have the i n h e r e n t quality of the p r e s e n t e d a d j e c t i v e . When he has n a m e s a s many m e m b e r s a s he can, he m u s t shift to a n o t h e r c a t e g o r y and begin to n a m e i t e m s f r o m it.
Thus, when p r e s e n t e d with an a d j e c t i v e f e w e r
i t e m s should be p r o d u c e d for two r e a s o n s : (a) The s u b j e c t m u s t decide which c a t e g o r y to e n t e r f i r s t , and this d e c i s i o n takes t i m e , and (b) he m u s t shift f r o m one c a t e g o r y to a n o t h e r w h e n e v e r he n e e d s to, and shifting takes t i m e An e x p e r i m e n t w a s d e s i g n e d to d e t e r m i n e w h e t h e r the n u m b e r of r e s p o n s e s given to a noun i s d i f f e r e n t f r o m the n u m b e r of r e s p c a s e s given to an a d j e c t i v e .
Two hundred s t u d e n t s
w e r e told that they would s e e s t i m u l i c o n s i s t i n g of e i t h e r a noun o r an a d j e c t i v e .
If the s t i m -
ulus w e r e a noun c a t e g o r y , they w e r e to w r i t e down a s many i t e m s a s they could that b e longed to that c a t e g o r y ,
F o r e x a m p l e , s u b j e c t s who w e r e p r e s e n t e d with the s t i m u l u s " s e a -
food" might say " o y s t e r ~', " c l a m " , and " s h r i m p " , a m o n g o t h e r p o s s i b i l i t i e s . If the s t i m u l u s w e r e an a d j e c t i v e , the s u b j e c t was to w r i t e down a s many i t e m s a s he could that had the i n h e r e n t quality of the a d j e c t i v e .
F o r e x a m p l e , if the s t i m u l u s w e r e " h a r d " , the s u b j e c t m i g h t
say " b r i c k " , ~'roek", " w o o d ' , e t c .
Details about the p r o c e d u r e can be found in Loftus (1972).
The m e a n n u m b e r of r e s p o n s e s given in one minute to noun s t i m u l i w a s 12.03 and to adjective s t i m u l i it w a s 9.15.
M o r e d e t a i l e d a n a l y s e s of the r e s p o n s e p r o t o c o l s indicated
that when the s t i m u l u s w a s a noun, a l m o s t all the r e s p o n s e s w e r e i n s t a n c e s of that noun c a t e gory.
However, when the s t i m u l u s was an a d j e c t i v e , s u b j e c t s tended to n a m e a n u m b e r of
i t e m s f r o m one c a t e g o r y , shift to a n o t h e r c a t e g o r y and n a m e a n u m b e r of i t e m s f r o m that c a t e g o r y , shift again, and sG on.
One s u b j e c t ' s r e s p o n s e p r o t o c o l to the s t i m u l u s " s m a l l "
i l l u s t r a t e s this tendency: " r a t , m o u s e , c a n a r y , p a r a k e e t , toe, f i n g e r , eye, e a r " . j e c t , i t can be s e e n , n a m e d two a n i m a l s , two b i r d s , and four p a r t s of the body.
This s u b -
These re-
stilts a r e c o n s i s t e n t with a m o d e l that d e s c r i b e s m e m o r y a s being o r g a n i z e d p r i m a r i l y into noun c a t e g o r i e s .
Only a f t e r a s u b j e c t has e n t e r e d a noun c a t e g o r y d o e s he find c l u s t e r s of
i t e m s that have qualities in c o m m o n .
In o t h e r w o r d s , a f t e r c o m p l e t i n g the f i r s t s t e p of the
r e t r i e v a l p r o c e s s {category e n t r y ) , the s u b j e c t may find a c l u s t e r of i n s t a n c e s to which a given adjective a p p l i e s . The second piece of evidence in s u p p o r t of the a s s u m p t i o n that the m e m o r y s t o r e is o r g a n i z e d p r i m a r i l y into noun c a t e g o r i e s g r e w out of a c o n v e r s a t i o n with Allan Collins at a 1971 m e e t i n g of the E a s t e r n V e r b a l I n v e s t i g a t o r ' s League.
We w e r e d i s c u s s i n g the finding
that r e a c t i o n t i m e is significantly f a s t e r when a noun c a t e g o r y c o m e s b e f o r e the a d j e c t i v e o r letter restrietor.
This finding is s o m e w h a t s u r p r i s i n g in view of the fact that E n g l i s h language
49 h a b i t s f a v o r an a d j e c t i v e - n o u n o r d e r .
We talk about a "yellow b i r d " but n e v e r a " b i r d yellow".
The q u e s t i o n a r i s e s a s to w h e t h e r t h e r e a r e s p e c i a l a d j e c t i v e s s u c h t h a t r e a c t i o n t i m e in a production t a s k would be f a s t e r if the a d j e c t i v e p r e c e d e d the noun.
P e r h a p s if we could find
a d j e c t i v e s t h a t w e r e m o r e c l o s e l y r e l a t e d to p a r t i c u l a r i n s t a n c e s than w e r e the s u p e r o r d i n a t e s of t h o s e i n s t a n c e s , a r e v e r s a l would o c c u r .
F o r e x a m p l e , if " s o u r " i s m o r e c l o s e l y
r e l a t e d to " l e m o n " than i s " f r u i t " , then p e r h a p s p r e s e n t i n g " s o u r " f i r s t and " f r u i t " s e c o n d would r e s u l t in a f a s t e r " l e m o n " . We u s e d the Kent and R o s a n o f f (1910) n o r m s a s one c o u r s e of a d j e c t i v e s . n o r m s a r e the a s s o c i a t i o n s of 1000 s u b j e c t s to 100 f a m i l i a r E n g l i s h w o r d s .
These
In the Kent and
R o s a n o f f n o r m s , the listing of r e s p o n s e s to " s o u r " i n d i c a t e s t h a t " l e m o n " o r " l e m o n s " i s the second most common response.
The only w o r d g i v e n m o r e often i s " s w e e t " .
In the B a t t i g
and Montague (1969) n o r m s , h o w e v e r , the r e s p o n s e s to " f r u i t " i n d i c a t e t h a t " l e m o n " is the ninth most common response. " l e m o n " than i s " f r u i t " .
T h u s , in s o m e s e n s e , " s o u r " i s m o r e c l o s e l y r e l a t e d to
Even in c a s e s s u c h a s t h e s e , h o w e v e r , r e a c t i o n t i m e is s h o r t e r
when the noun i s p r e s e n t e d f i r s t .
The r e t r i e v a l model p r o p o s e d a c c o u n t s for t h i s fact by
a s s u m i n g t h a t m e m o r y i s o r g a n i z e d p r i m a r i l y into a c o m p l e x h i e r a r c h y of noun c a t e g o r i e s and t h a t the f i r s t step of the r e t r i e v a l p r o c e s s is to e n t e r one of t h e s e noun c a t e g o r i e s . 2. E a c h c a t e g o r y in the h i e r a r c h i c a l o r g a n i z a t i o n c a n be e n t e r e d d i r e c t l y . A portion of a h y p o t h e t i c a l m e m o r y s t r u c t u r e m i g h t c o n s i s t s of " l i v i n g t h i n g " with " a n i m a l " and " v e g e t a b l e " a s s u b s e t s of it, the s u p e r s e t " b i r d " and " s n a k e " a s s u b s e t s of " a n i m a l " , a n d " c a n a r y " and " r o b i n " a s i n s t a n c e s of the s u b s e t " b i r d " .
Suppose f o r a m o m e n t
t h a t a c a t e g o r y n a m e c a n n o t be l o c a t e d d i r e c t l y , but m u s t be found by b e g i n n i n g a t the top of the s e m a n t i c h i e r a r c h y and s e a r c h i n g don w a r d t h r o u g h the h i e r a r c h y .
I t follows t h a t the
t i m e r e q u i r e d to r e t r i e v e an i n s t a n c e of any c a t e g o r y should r e f l e c t the n u m b e r of s u p e r s e t s t h r o u g h which the s u b j e c t m u s t move b e f o r e finding the a p p r o p r i a t e c a t e g o r y .
T h u s , we
would e x p e c t the t i m e t a k e n to r e t r i e v e an i n s t a n c e of the c a t e g o r y " b i r d " to be g r e a t e r t h a n the t i m e to r e t r i e v e an a n i m a l , b e c a u s e the s u b j e c t m u s t move t h r o u g h at l e a s t one e x t r a s u p e r s e t to l o c a t e the c a t e g o r y " b i r d " .
Note that we have o p e r a t i o n a l l y d e s c r i b e d the h i e r -
a r a c h y by a s s u m i n g that, f o r a s n p e r o r d i n a t e - s u b o r d i n a t e p a i r of c a t e g o r i e s s u c h a s a n i m a l b i r d , the s u p e r o r d i n a t e (which i n c l u d e s e v e r y t h i n g t h a t belongs in the s u b o r d i n a t e category) will b e h i g h e r on the h i e r a r c h y .
F o r any s u p e r o r d i n a t e - s u b o r d i n a t e p a i r , t h e n , r e t r i e v i n g
an i n s t a n c e of the s u p e r o r d i n a t e c a t e g o r y should take l e s s t i m e , a c c o r d i n g the view t h a t e a c h c a t e g o r y c a n n o t be locate d i r e c t l y . A l t e r n a t i v e l y , suppose that when a s e a r c h p r o c e s s b e g i n s with a p a r t i c u l a r c a t e g o r y n a m e , t h a t n a m e is d i r e c t l y a c c e s s i b l e by s o m e c e n t r a l p r o c e s s o r , i n s t e a d of b e i n g a c c e s s i b l e only via a s e a r c h along a h i e r a r c h i c a l path.
In t h i s c a s e , t h e r e i s no r e a s o n to e x p e c t
50 any d i f f e r e n c e in the t i m e t a k e n to r e t r i e v e a n i n s t a n c e of the c a t e g o r y " b i r d " and the t i m e t a k e n to r e t r i e v e an a n i m a l . We have d e s i g n e d au e x p e r i m e n t to d e t e r m i n e w h e t h e r the t i m e r e q u i r e d to n a m e an i n s t a n c e of a c a t e g o r y is d e p e n d e n t upon the position of the c a t e g o r y in a s e m a n t i c h i e r a r c h y . In d e s i g n i n g the e x p e r i m e n t , a c e n t r a l p r o b l e m was to e n s u r e that c a t e g o r i e s u s e d could be c l a s s i f i e d a c c u r a t e l y a c c o r d i n g to t h e i r r e l a t i v e position in the h i e r a r c h y .
This was accomp-
l i s h e d by u s i n g p a i r s of n e s t e d c a t e g o r i e s in w h i c h the s u p e r o r d i n a t e c a t e g o r y included by definition e v e r y t h i n g t h a t belonged in the s u b o r d i n a t e c a t e g o r y .
F o r e x a m p l e , the c a t e g o r y
" b e v e r a g e s " c o n t a i n s all a l c o h o l i c b e v e r a g e s , " m u s i c a l i n s t r u m e n t s " c o n t a i n s all s t r i n g e d i n s t r u m e n t s , and " a n i m a l s " c o n t a i n s a l l b i r d s .
In t h i s e x p e r i m e n t the s u b j e c t was p r e s e n t e d
w i t h both a s u p e r s e t n a m e (e. g . , b e v e r a g e ) , and r e q u i r e d to give a m e m b e r of t h a t c a t e g o r y , and a s u b s e t n a m e (e. g . , alcoholic b e v e r a g e ) and r e q u i r e d to give a m e m b e r of it.
This
allowed a d i r e c t c o m p a r i s o n of the t i m e t a k e n to produce m e m b e r s of s u p e r s e t s and s u b s e t s . F o r a d d i t i o n a l d e t a i l s , s e e Loftus, e t al. (1970). Subjects took a n a v e r a g e of 1.60 s e e . to p r o d u c e a m e m b e r of a s u p e r o r d i n a t e c a t e g o r y , and 1 . 4 9 s e c . to p r o d u c e a m e m b e r of a s u b o r d i n a t e c a t e g o r y .
This nonsignificant
d i f f e r e n c e is i n c o n s i s t e n t with the view t h a t a s e a r c h p r o c e s s b e g i n s at the top of the h i e r a r c h y and follows pathways downward t h r o u g h the n e t w o r k .
Such a view would p r e d i c t l o n g e r
t i m e s for a s u b s e t c a t e g o r y than for a s u p e r s e t c a t e g o r y s i n c e the s u b s e t is l o c a t e d c l o s e r to the b o t t o m of the h i e r a r c h y . opposite d i r e c t i o n .
The p r e s e n t r e s u l t a c t u a l l y i n d i c a t e s a s l i g h t d i f f e r e n c e in the
T h e s e data a r g u e in f a v o r of a m o d e l in which e a c h c a t e g o r y can be
located directly. 3,
The r e t r i e v a l p r o c e s s c o n s i s t s of two m a j o r s t e p s .
In t h i s s e c t i o n , we d i s c u s s two e x p e r i m e n t s t h a t w e r e o r i g i n a l l y d e s i g n e d to p r o v i d e m o r e i n f o r m a t i o n a s to why s o m e i t e m s a r e r e s p o n d e d to quickly while o t h e r s r e q u i r e a c o n siderably longer response time.
F o r e x a m p l e , s u b j e c t s take l e s s than 1.00 sec. to n a m e a
c o l o r , but they take n e a r l y twice a s long to n a m e a building (Loftus, et a l . , 1970).
If e a c h
c a t e g o r y i s e n t e r e d d i r e c t l y , the r e a s o n t h a t s o m e c a t e g o r i e s a r e l e s s a c c e s s i b l e than o t h e r s c a n n o t be due to the n e c e s s i t y of s e a r c h i n g t h r o u g h m o r e of the h i e r a r c h y to r e a c h t h o s e categories. One possible answer
to the question of why the speed of producing instances of some
categories is faster than others is suggested by the effect of word frequency on identification time.
It is well established that reaction times to identify high frequency words
than for low frequency words nition may
(Rubenstein,
et al., 1970).
are faster
This difference in ease of recog-
account for difference in the speed of producing instances of a category.
51
C l e a r l y , s t i m u l u s r e c o g n i t i o n i s a l o g i c a l l y n e c e s s a r y s t e p in p r o d u c t i o n of a r e s p o n s e from memory.
In o t h e r w o r d s , when a s u b j e c t i s a s k e d to n a m e a m e m b e r of a p a r t i c u l a r
c a t e g o r y , he m u s t " r e c o g n i z e " the s t i m u l u s w o r d (in t h i s c a s e , the c a t e g o r y n a m e ) b e f o r e h e c a n find and produce a m e m b e r of the c a t e g o r y .
T h u s , the p r o d u c t i o n of the r e s p o n s e " p e a c h "
to the s t i m u l u s " f r u i t " depends not only on the e x i s t e n c e in m e m o r y of a link b e t w e e n " p e a c h " and '*fruit", but a l s o upon the s e m a n t i c i d e n t i f i c a t i o n of " f r u i t " when it is p r e s e n t e d .
The
r e c o g n i t i o n o r s e m a n t i c i d e n t i f i c a t i o n of a c a t e g o r y n a m e m a y be e q u i v a l e n t o r a t l e a s t a p a r t of w h a t we have b e e n c a l l i n g " c a t e g o r y e n t r y " o r s t e p i of the r e t r i e v a l p r o c e s s . If the f i r s t s t e p in the r e t r i e v a l p r o c e s s is indeed r e c o g n i t i o n of the c a t e g o r y n a m e and if r e c o g n i t i o n s p e e d is a function of the f r e q u e n c y in the language of t h a t n a m e , then t h i s step of the p r o c e s s should c l e a r l y take l o n g e r for c a t e g o r i e s whose n a m e s a r e low f r e q u e n c y words.
O t h e r things b e i n g equal, then, the t o t a l t i m e to n a m e a m e m b e r of a c a t e g o r y with
a h i g h - f r e q u e n c y n a m e should be s h o r t e r than the t i m e to n a m e a m e m b e r of a l o w - f r e q u e n c y category. An e x p e r i m e n t was conducted in w h i c h s u b j e c t s w e r e p r e s e n t e d w i t h a s e r i e s of c a t e g o r y n a m e s , and had to r e s p o n d with the f i r s t word t h a t they could think of belonging to the c a t e g o r y .
We will r e f e r to t h i s as E x p e r i m e n t I; m o r e c o m p l e t e d e t a i l s c a n be found in
Loftus and F r e e d m a n (1972),
The m e a n t i m e to produce a m e m b e r of a c a t e g o r y w h o s e ~ a m e
is a high f r e q u e n c y word w a s i . 64 sec° and to p r o d u c e a m e m b e r of a c a t e g o r y w h o s e n a m e is a low f r e q u e n c y word was i . 89 s e c .
The d i f f e r e n c e was highly s i g n i f i c a n t , i n d i c a t i n g
c l e a r l y t h a t the f r e q u e n c y of the c a t e g o r y n a m e is a s s o c i a t e d w i t h s p e e d of p r o d u c i n g a n i n s t a n c e of t h a t c a t e g o r y .
We have s u g g e s t e d t h a t t h i s is due to the g r e a t e r t i m e r e q u i r e d
m e r e l y to identify the l o w e r f r e q u e n c y n a m e .
The p o s s i b i l i t y r e m a i n s , h o w e v e r , t h a t the
f r e q u e n c y of the n a m e a l s o a f f e c t s the s e c o n d p a r t of the r e t r i e v a l p r o c e s s - - t h a t p a r t w h i c h o c c u r s a f t e r the n a m e h a s b e e n identified.
In o t h e r w o r d s , once the s t i m u l u s h a s b e e n fully
" r e c o g n i z e d " , it m a y s t i l l take l o n g e r to n a m e a m e m b e r of a c a t e g o r y with a low f r e q u e n c y name.
A s e c o n d e x p e r i m e n t , w h i c h we r e f e r to a s E x p e r i m e n t H, w a s d e s i g n e d to t e s t t h i s
possibility. In the s e c o n d e x p e r i m e n t , the p r o b l e m w a s to d e s i g n a p r o c e d u r e t h a t would e l i m i n a t e d i f f e r e n c e s due to the f i r s t ( r e a d i n g and identification) p a r t of the r e t r i e v a l p r o c e s s but t h a t would e n a b l e us to m e a s u r e the s p e e d of the r e s t of the p r o c e s s (finding and producing the correct response).
The f i r s t r e q u i r e m e n t w a s m e t by giving the s u b j e c t the c a t e g o r y n a m e a
full 3 sec. b e f o r e he had to m a k e any r e s p o n s e .
Since the f i r s t step t a k e s c o n s i d e r a b l y l e s s
than 3 s e c . p r e s u m a b l y t h i s p r o v i d e d a m p l e t i m e for the s u b j e c t to r e a d and identify any c a t e g o r y n a m e , and thus e l i m i n a t e d any d i f f e r e n c e s in r e s p c u se t i m e due to d i f f e r e n c e in r e a d i n g speed.
It was e s s e n t i a l a t t h i s point to p r e v e n t the s u b j e c t f r o m i m m e d i a t e l y b e g i n -
52 ning the r e s t of the r e t r i e v a l p r o c e s s until we in e s s e n c e told him to s t a r t .
This w a s
a c c o m p l i s h e d by r e q u i r i n g a v a r i e t y of r e s p o n s e s to the c a t e g o r y n a m e so that the s u b j e c t did not know ahead of time which r e s p o n s e he would have to give and a c c o r d i n g l y would not know for which to begin s e a r c h i n g .
The idea was that u n d e r t h e s e c i r c u m s t a n c e s the s u b j e c t
would wait until he was a s k e d for a p a r t i c u l a r r e s p o n s e to begin the a p p r o p r i a t e r e t r i e v a l process.
The s u b j e c t was given a c a t e g o r y n a m e and w a s r e q u i r e d to a n s w e r s e v e r a l q u e s t i o n s about that c a t e g o r y .
The q u e s t i o n s ( i n s t r u c t i o n s ) w e r e : (a) " f i r s t l e t t e r " , in which the s u b -
j e c t r e s p o n d e d with the f i r s t l e t t e r of the c a t e g o r y n a m e ; (b) " l a s t l e t t e r " , in which c a s e the s u b j e c t r e s p o n d e d with the l a s t l e t t e r of the c a t e g o r y n a m e ; (c) " l e n g t h " , in w h i c h c a s e the s u b j e c t r e s p o n d e d with the n u m b e r of l e t t e r s in the c a t e g o r y ; and (d) " m e m b e r " , in w h i c h c a s e the s u b j e c t r e s p o n d e d with the f i r s t w o r d that he could think of that n a m e d an object that belonged in the c a t e g o r y .
We took p r e c a u t i o n s to e n s u r e that the s u b j e c t s would not always
e x p e c t to produce a m e m b e r of any given c a t e g o r y .
F o r d e t a i l s the r e a d e r is r e f e r r e d to
Loftus and F r e e d m a n (1972). The data of i n t e r e s t w e r e the r e s p o n s e t i m e s of c o r r e c t r e s p o n s e s to the " m e m b e r " question.
The m e a n t i m e to p r o d u c e a m e m b e r of a c a t e g o r y
w h o s e n a m e is high f r e q u e n c y
was 1.48 s e c . and to produce a m e m b e r of a c a t e g o r y w h o s e n a m e is low f r e q u e n c y was 1.67 s e c . , a highly s i g n i f i c a n t d i f f e r e n c e .
Thus e v e n a f t e r the s u b j e c t has had a m p l e t i m e to r e a d
and identify the c a t e g o r y than a high f r e q u e n c y c a t e g o r y . What do we make of t h e s e r e s u l t s ?
R e c a l l that in the o r i g i n a l e x p e r i m e n t , s u b j e c t s
w e r e p r e s e n t e d with a noun c a t e g o r y plus a r e s t r i c t i n g l e t t e r o r a d j e c t i v e , and p r o d u c e d an i n s t a n c e of the c a t e g o r y w h i c h s a t i s f i e d the r e s t r i c t i o n i m p o s e d . When the c a t e g o r y n a m e was p r e s e n t e d f i r s t , the m e a n r e a c t i o n t i m e was 1.87 s e c . ; with the c a t e g o r y n a m e p r e s e n t e d second, it was 2.12 s e c .
The d i f f e r e n c e o f . 25 s e c . was quite stable a c r o s s s o m e w h a t d i f -
f e r e n t conditions, and was taken as e v i d e n c e that the d u r a t i o n of c a t e g o r y e n t r y , or s t e p 1 of the r e t r i e v a l p r o c e s s , was a p p r o x i m a t e l y . 25 s e c . The two e x p e r i m e n t s just d i s c u s s e d a l s o provide an e s t i m a t e of the duration of s t e p 1. In E x p e r i m e n t 1 the m e a n r e a c t i o n t i m e was 1.89 for low f r e q u e n c y c a t e g o r i e s and t . 64 s e c . f o r high f r e q u e n c y c a t e g o r i e s . 1.48 s e c . , r e s p e c t i v e l y .
In E x p e r i m e n t II the c o r r e s p o n d i n g t i m e s w e r e 1.67 s e c . and
Since E x p e r i m e n t I included identification t i m e (i. e . , included c a t e -
g o r y entry') ~hile E x p e r i m e n t II did not, the d i f f e r e n c e s in r e a c t i o n t i m e between the two e x p e r i m e n t s provide s o m e indication of identification t i m e .
F o r low f r e q u e n c y c a t e g o r i e s the
d i f f e r e n c e is . 22 s e c . (1.89 - 1.67) and for high f r e q u e n c y c a t e g o r i e s it i s . t6 s e c . (1.64 1.48).
A s e x p e c t e d , identification o r e n t r y of a low f r e q u e n c y c a t e g o r y t a k e s l o n g e r than for
a high f r e q u e n c y c a t e g o r y .
The m e a n for all c a t e g o r i e s is . t9 s e c .
Thus, although the
53
p r e s e n t p r o c e d u r e s a r e quite d i f f e r e n t f r o m t h a t u s e d in the o r i g i n a l e x p e r i m e n t and involve r e l a t i v e l y s i m p l e ( u n r e s t r i c t e d ) r e s p o n s e s , the e s t i m a t e s of t h e d u r a t i o n of s t e p t o b t a i n e d i n the two p a p e r s is quite c o m p a r a b l e (. 25 sec. v s . .
19 s e e . ) .
Conclusion Our b a s i c conception of h u m a n m e m o r y i s t h a t of a s t o r e c o n s i s t i n g of a l a r g e n u m b e r of i n t e r c o n n e c t e d and c r o s s - r e f e r e n c e d a s s o c i a t i v e and c a t e g o r y n e t w o r k s .
According
to the model, m e m o r y is o r g a n i z e d into a complex h i e r a r c h y c o m p o s e d of c a t e g o r i e s (e. g . , a n i m a l s ) with s u b s e t s of e a c h (e. g . , b i r d s , dogs) and s u p e r s e t s (e. g . , living things).
Fur-
t h e r m o r e , when a s e a r c h b e g i n s with a p a r t i c u l a r c a t e g o r y n a m e , t h a t c a t e g o r y c a n be e n t e r e d d i r e c t l y , without f i r s t s e a r c h i n g t h r o u g h o t h e r c a t e g o r i e s .
T h u s , to find a b i r d , the
c a t e g o r y " b i r d s " is e n t e r e d ; to find an a n i m a l , the c a t e g o r y " a n i m a l s " i s e n t e r e d , and s o on. A g e n e r a l m o d e l of the r e t r i e v a l p r o c e s s a s s u m e s t h a t the e n t i r e p r o c e s s c o n s i s t s of at l e a s t two m a j o r s t e p s : (a) e n t e r i n g an a p p r o p r i a t e c a t e g o r y and (b) finding and p r o d u c i n g a n a p p r o p r i a t e m e m b e r of t h a t c a t e g o r y , We have p r e s e n t e d the r e s u l t s of s e v e r a l e x p e r i m e n t s to s u p p o r t v a r i o u s a s p e c t s of the model.
F o r e x a m p l e , s u p p o r t for the view t h a t the r e t r i e v a l p r o c e s s c o n s i s t s of at l e a s t
two m a j o r s t e p s c o m e s f r o m the r e d u c t i o n in t o t a l r e a c t i o n t i m e o b t a i n e d w h e n a s u b j e c t h a s a l r e a d y r e a d and " i d e n t i f i e d " the c a t e g o r y n a m e .
T h i s r e d u c t i o n r a n g e s f r o m . 19 to . 25,
depending on the t a s k , and it s e r v e s as an i n d i c a t i o n of the d u r a t i o n of the f i r s t s t e p o2 the process. F u r t h e r d e v e l o p m e n t and t e s t i n g of t h i s model is badly needed, model is m o r e like a l o o s e outline t h a n a s p e c i f i c t h e o r y ,
At t h i s point t h e
Much m o r e r e s e a r c h will be
n e e d e d b e f o r e we c a n a c t u a l l y t r a n s l a t e t h i s outline into a c o n c r e t e model.
Even more re-
s e a r c h will be n e c e s s a r y b e f o r e we c a n build a r e a l i s t i c m o d e l t h a t t r u l y d e s c r i b e s t h e c h a r a c t e r i s t i c s of h u m a n m e m o r y .
One fruitful d i r e c t i o n would involve a r e f i n e d a n a l y s i s of d a t a
f r o m individual s u b j e c t s r a t h e r t h a n a n a l y s i s of d a t a a v e r a g e d a c r o s s s u b j e c t s , b e c a u s e the h i e r a r c h i c a l o r g a n i z a t i o n s u r e l y v a r i e s a c c o r d i n g to individual u s a g e and e x p e r i e n c e f r o m s u b j e c t to s u b j e c t .
We plan to t u r n to s u c h individual a n a l y s e s in f u t u r e w o r k .
References Battig, W . F . and W . E . Montague (1969), " C a t e g o r y N o r m s for V e r b a l I t e m s in 56 C a t e g o r i e s : A R e p l i c a t i o n and E x t e n s i o n of t h e C o n n e c t i c u t C a t e g o r y N o r m s " , J o u r n a l of E x p e r i m e n t a l Psychology, 80__, 3. C o l l i n s , A . M . and M.R. Quillian (1969), '~Retrieval T i m e f r o m S e m a n t i c M e m o r y " , J o u r n a l of V e r b a l L e a r n i n g and V e r b a l B e h a v i o r , 8, 240-247. F r e e d m a n , J . L . and E. F, Loftus (1971), 'TRetrteval of W o r d s f r o m L o n g - T e r m M e m o r y " , J o u r n a l of V e r b a l L e a r n i n g and V e r b a l B e h a v i o r , 10, 107-115.
54
Green, B . R . , J r . , A.K. Wolf, C. Chomsky, and K. Laughery (1963), "Baseball: An Automarie Question Answerer", in E.A. Feigenbaum and J. Feldman (eds.), Computers and Thought, New York: McGraw-Hill Company. Kent, G.H. and A.J. Rosanoff (1910), "A Study of Association in Insanity", American Journal of Insanity, 67, 37-96. Landauer, T. K, and J.L. Freedman (1968), "Information Retrieval from Long-Term Memory: Category Size and Recognition Time", Journal of Verbal Learning and Verbal Behavior, 7, 291-295. Lindsay, R.K. (t963}, "Inferential Memory as the Basis of Machines which Understand Natural Language", in E.A. Feigenbaum and J. Feldman (eds.), Computers and Thought, New York: McGraw-Hill Company. Loftus, E . F . (1972), "Nouns, Adjectives and Semantic Memory", Journal of Experimental Psychology, 1972, 96, 213-215. Loftus, E . F . and J, L. Freedman (1972), "Effect of Category-Name Frequency on the Speed of Naming an Instance of the Category", Journal of Verbal Learning and Verbal Behavior, 11, 343-347. Loftus, E . F . , J.L. Freedman, and G.R. Loftus (1970), ' ~ e t r i e v a l of Words from Subordinate and Superordinate Categories in Semantic Hierarchies", Psyehonomie Science, 2__1, 235-236. Meyer, D.E. (1970), "On the Representation and Retrieval of Stored Semantic Information", Cognitive Psychology, 21, 242-300. Neisser, U. (t963), "Decision-Time Without Reaction Time", American Journal of Psychology, 7_6, 376-385. Pollack, I. (1963), "Speed of Classification of Words into Superordinate Categories", Journal of Verbal Learning and Verbal Behavior, 2, 159-165. Rabbitt, P. M.A. (1959), "Effects of Independent Variations in Stimulus and Response Probability", Nature, 183, 1212. Rubenstein, H., L. Garfield, and J.A. Millikan (1970), "Homogr phic Entries in the Internal Lexicon", Journal of Verbal Learning and Verbal Behavior, 9, 487-494. Shepard, R. (1972), "Some Illustrative Applications", Handout prepared for Multidimensional Scaling Workshop, University of Pennsylvania, June. Sternberg, S. (1966), "High-Speed Scanning in Human Memory;' Science, 153., 652-654. Woodworth, R.S. and N. Schlosberg (1954), Experimental Psychology, New York: Holt, Rinehart, and Winston. Acknowledgment The preparation of this paper was supported by the National Institutes of Health under Grant No. MH-20280.
IMPLICATION
AS AN ALTERNATIVE TO SET-INCLUSION AS THE SEMANTIC PRIMITIVE
Arnold Lewis Glass Stanford U n i v e r s i t y
The c o m p o n e n t i a l a n a l y s i s of language a s an a p p r o a c h to s e m a n t i c s h a s a long, r i c h h i s t o r y s p a n n i n g s e v e r a l d i s c i p l i n e s , including philosophy, l i n g u i s t i c s , and psychology. The b a s i c idea i s t h a t a w o r d c a n be b r o k e n down into a s e t of p r i m i t i v e p r o p e r t i e s ( o r i d e a s , f e a t u r e s , m a r k e r s , e t c . ) t h a t c a n then be said to c o n s t i t u t e its m e a n i n g .
For example, man
m a y be i n t u i t i v e l y a n a l y z e d a s the s e t of p r o p e r t i e s ( m a l e , human); and p e r h a p s the p r o p e r t y " h u m a n " m a y be f u r t h e r a n a l y z e d a s ( i n t e l l i g e n t , m a m m a l ) , etc.
T h e s e p r o p e r t i e s ( a s they
will h e n c e f o r t h be called) a r e u l t i m a t e l y r e p r e s e n t e d a s a t o m i c , u n i t a r y , and i n d e p e n d e n t particles.
T h e y m a y be thought of a s a c o l l e c t i o n of uniquely c o l o r e d m a r b l e s , w h e r e a n y
a s s o r t m e n t is p o s s i b l e . The a s s u m p t i o n of i n d e p e n d e n t p r o p e r t i e s i s c o m m o n to a wide v a r i e t y of s u b s t a n t i a l l y d i f f e r e n t t h e o r i e s w h i c h have a p p e a r e d in d i f f e r e n t d i s c i p l i n e s .
Katz and F o d o r (1963)
use m a r k e r s and d i s t i n g u i s h e r s to d i s a m b i g u a t e the m e a n i n g of a w o r d in the context of a particular sentence.
Schaffer and W a l l a c e (1970) and M e y e r (1970) have p r o p o s e d s e t -
i n c l u s i o n m o d e l s to explain the c o r r e l a t i o n b e t w e e n the t i m e i t t a k e s to v e r i f y w h e t h e r a w o r d is a m e m b e r of a c e r t a i n s e m a n t i c c a t e g o r y and the " s e m a n t i c d i s t a n c e " between t h a t w o r d and the c a t e g o r y .
F o r e x a m p l e , it t a k e s l o n g e r for a s u b j e c t to judge " t r u e " in r e -
s p o n s e to the s t a t e m e n t " a c a n a r y i s a n o r g a n i s m " than i t t a k e s to v e r i f y " a c a n a r y i s a bird".
The logical d e c i s i o n in t h e s e s e t - i n c l u s i o n m o d e l s r e s t s on the p r e s e n c e of c e r t a i n
p r o p e r t i e s in the i n t e r s e c t i o n of the s e t s of p r o p e r t i e s defining w o r d s . is s e a r c h e d for a p r o p e r t y in the i n t e r s e c t i o n . with the a m o u n t of o v e r l a p b e t w e e n s e t s .
The union of the s e t s
Hence, s p e e d of v e r i f i c a t i o n i s c o r r e l a t e d
As a final e x a m p l e of c o m p o n e n t i a l a p p r o a c h e s ,
p r o g r a m s t h a t a t t e m p t to s i m u l a t e h u m a n language c o m p r e h e n s i o n (e. g . , Shank, t972; W i n o g r a d , 1972) utilize a p r i o r i defined p r i m i t i v e s o r p r o p e r t i e s . The L i m i t a t i o n s of a C o m p o n e n t i a l A n a l y s i s While c o m p o n e n t i a l a n a l y s i s h a s b e e n widely applied, i t h a s l i m i t a t i o n s . q u e s t i o n is a s k e d , "Is a n e l m a t r e e ? " ,
If the
the a n s w e r is sought in a c o m p o n e n t i a l model by
s e a r c h i n g a s e t l a b e l l e d e l m for a p r o p e r t y l a b e l l e d " t r e e " , o r e q u i v a l e n t l y , following a n a r r o w f r o m a node l a b e l l e d e l m to a p r o p e r t y l a b e l l e d " t r e e " . sufficient.
T h i s is c e r t a i n l y l o g i c a l l y
But f r o m a d e v e l o p m e n t a l point of view, how did t h e s e n o d e s get f o r m e d and
t h e i r s e t - r e l a t i o n s get s p e c i f i e d in the f i r s t p l a c e ? this question,
T h e r e a r e s e v e r a l p o s s i b l e a n s w e r s to
56 One a n s w e r is that the c o m p o n e n t s stand for independent p e r c e p t u a l f e a t u r e s .
In
this v e r s i o n of the t h e o r y , a v e r y s m a l l s e t of p e r c e p t u a l f e a t u r e s c h a r a c t e r i z e the s e t defining the c o n c e p t " p l a n t " , a s u p e r s e t of it c h a r a c t e r i z e s " t r e e " , and a s u p e r s e t of " t r e e " c h a r a c t e r i z e s '~elm".
Since a s m a l l s e t of p e r c e p t u a l f e a t u r e s a r e contained in the s e t f o r
" p l a n t " , a l a r g e s e t of o b j e c t s wilt have all the p e r c e p t u a l f e a t u r e s of " p l a n t " .
Some of the
o b j e c t s having all of the p e r c e p t u a l f e a t u r e s of "plant" will have all of the p e r c e p t u a l f e a t u r e s of " t r e e " .
Hence, it can be deduced f r o m t h e s e definitions that the s e t of o b j e c t s c a l l e d
plants includes the s e t of o b j e c t s c a l l e d t r e e s ; o r , c o n v e r s e l y , all t r e e s a r e plants. logical i m p l i c a t i o n is defined in t e r m s of p e r c e p t u a l f e a t u r e s .
Thus,
However, while the p e r c e p -
tual r e l a t i o n s h i p that e x i s t s between t r e e s and plants is c e r t a i n l y an i n s t a n c e of the a p p l i c a tion of logical implication, t h e r e a r e p r o b l e m s with making it the definition of logical i m p l i cation, s i n c e t h e r e a r e o t h e r u s e s of logical i m p l i c a t i o n w h e r e p e r c e p t u a l s i m i l a r i t y does not a p p e a r r e l e v a n t .
It d o e s not a p p e a r that a whale i s c l a s s e d with a dog (as a mammaD
i n s t e a d of a s h a r k (as a fish) on the b a s i s of p e r c e p t u a l s i m i l a r i t y .
B e n c h e s a r e c l a s s e d with
c h a i r s on the b a s i s of t h e i r function a s s o m e t h i n g to sit on r a t h e r than with t a b l e s on the
basis of perceptual similarity. implies p" seem reason,
And the statements
to have no interpretation in terms
defining components A second answer
solely in terms
"All men
of perceptual similarity at all.
for such primitives have run from "object" and "property"
what the theory can't explain.
which express logical
at a person's disposal due to innate mechanisms.
Postulating a primitive,
of course,
to "agent",
Asserting the existence of a primitive is only an empirical
something which underlies
is to make
the sets of properties more
abstract so that they can
represent any relationship which can be stated in natural language. be stated which generate this representation This is the approach
No concepts like the ones mentioned
above will be assumed
sentation on which logical decisions can be made how this representation
in the narrowest
that will be taken in this paper. to be innate.
A formal repre-
will be defined; and it will briefly be shown
can be generated by experience
one point of view, it may
In this case a system of
and relate it back to sensory data
which reference the external world.
models
is well-
thought.
A third answer
From
and
does not explain it, but only describes
defined and it is seriously argued that the primitive represents
rules must
Candidates
"causality",
claim to the extent which the relation of the primitive to the rest of the system
all human
For this
of perceptual features appears inadequate.
is to define a set of "primitive" components
relationships and are somehow
"implication".
are mortal" and "p and q
and related to natural language.
be considered that this model is a refutation of componential
sense of the term,
tation go beyond set-theoretic axioms.
since the axioms
However,
the model
used to generate the represenmay
also be seen as an extension
57 of t r a d i t i o n a l c o m p o n e n t i a l work, taking up a q u e s t i o n w h i c h p a s t t h e o r i s t s w e r e n ' t a l w a y s c o n c e r n e d with: how the r e p r e s e n t a t i o n i s g e n e r a t e d . Logical I m p l i c a t i o n B e t w e e n P r o p e r t i e s . A l m o s t any c o n c e p t can be f u r t h e r d i s c r i m i n a t e d into an a r b i t r a r y n u m b e r of s u b concepts.
" C o l o r e d " can be d i s c r i m i n a t e d into " r e d " and " g r e e n " , " g r e e n " in t u r n m a y be
d i s c r i m i n a t e d into " k e l l y " and " f o r e s t " . " T e e t h " m a y be d i s c r i m i n a t e d into " m e c h a n i c a l t e e t h " a n d " a n i m a l teeth", " a n i m a l t e e t h " m a y be d i s c r i m i n a t e d into " s h a r k t e e t h " and " h u m a n t e e t h " , and " h u m a n t e e t h " m a y be d i s c r i m i n a t e d into " m o l a r s " and " i n c i s o r s " .
It
does not s e e m likely t h a t when a w o r d i s used, i m p l i c i t in the u n d e r l y i n g c o n c e p t i s all the s u b c o n e e p t s which c a n l a t e r be thought up. biguous, but it is vague. tion.
F r o m t h i s point of view, a concept i s not a m -
E a c h s u b c o n c e p t is r e l a t e d to i t s s u p e r o r d i n a t e by logical i m p l i c a -
Thus, " m o l a r " i m p l i e s " h u m a n t e e t h " , " h u m a n t e e t h " i m p l i e s " a n i m a l t e e t h " , and
"animal teeth" implies "teeth".
A c o n c e p t t r e e i s shown in F i g u r e 1.
An e n t i r e t r e e will be
r e f e r r e d to a s a c o n c e p t while e a c h node on the t r e e will be r e f e r r e d to a s a p r o p e r t y .
t
e
e
t
animal teeth
teeth
teeth
/\
/\ molar
~
meci~anical teeth
teeth
incisor
For
inner teeth
FIG. 1.
outer teeth
teeth
teeth
teeth
teeth
teeth
The R e p r e s e n t a t i o n of the Concept T r e e for " T e e t h " .
e x a m p l e , in F i g u r e 1, the concept " t e e t h " i n c l u d e s the e n t i r e t r e e .
The c o n c e p t " a n i m a l
t e e t h " i n c l u d e s the p r o p e r t i e s " a n i m a l t e e t h " , " s h a r k t e e t h " , " h u m a n t e e t h " , " i n n e r t e e t h " , " o u t e r t e e t h " , " m o l a r s " , and " i n c i s o r s " .
The c o n c e p t " h u m a n t e e t h " i n c l u d e s the p r o p e r -
t i e s " h u m a n t e e t h " , " m o l a r s " , and " i n c i s o r s " .
The u s e of the t e r m p r o p e r t y h e r e for a node
on a t r e e i s e n t i r e l y c o n s i s t e n t with the e a r l i e r u s e a s the c o m p o n e n t of s e m a n t i c a n a l y s i s , s i n c e they will e v e n t u a l l y be shown to be the s a m e thing. Two c o n c e p t t r e e s c a n i n t e r s e c t and have a p r o p e r t y in c o m m o n .
The c o n c e p t t r e e
for " m a l e " and the c o n c e p t t r e e for " h u m a n " i n t e r s e c t at the p r o p e r t y " m a n " .
Then, s i n c e
5B
both trees include the property, property
"animal
grammed
"man )' implies both )'male ') and )'human".
teeth" implies both ~'animal" and "teeth".
These
Similarly,
examples
the
are dia-
in Figure 2.
male
anima~
teeth
man FIG. 2.
The R e p r e s e n t a t i o n of Intersection Concept T r e e s .
A single p r o p e r t y may have m o r e than one concept t r e e a s s o c i a t e d with it. example,
the properties
"animal",
"bird",
and "fish" all imply the property "animal".
and "fish" are part of one concept tree while "animal"
of another concept tree. ordinates within the same fish.
"pet", "bird",
This can be seen from
For But
and "pet" are part
the fact that two properties which are sub-
concept tree are mutually exclusive,
But a bird can be a pet, thus their underlying
concepts
i.e., a bird can not be a must
be distinct.
Logical Decision Making in the F o r m a l Model. It witl be apparent that many of the definitions of r e l a t i o n s a r e r e a l l y t h e o r e m s which can be proved f r o m a few simple axioms which define the model.
But it is not the
purpose of this paper to p r e s e n t mathematical proofs, so all r e l a t i o n s will simply be defined without attempting to distinguish which ones can be derived. Axioms. 1.
T h e r e exists a set P of p r o p e r t i e s , such that P = (Pl .
. . . .
pn ), where Pi is a
property. 2.
A concept_ t r e e Tx is a lattice like the one shown in F i g u r e 1, w h e r e if pj is
below Pi (Pj c Tx(Pi)) , then Pi~ implies Pi" F o r example, in F i g u r e 1, since "human teeth" is below " a n i m a l teeth", "human teeth" i m p l i e s " a n i m a l teeth". 3.
A word is defined as a nonempty set of p r o p e r t i e s : for all i, w. c p and w. ~ 0. 1
1
A w o r d must be defined as a set of p r o p e r t i e s to deal with the obvious but important fact that many words a r e ambiguous,
F o r example, a club is both a weapon and a social organization.
If a one-to-one mapping existed between words and p r o p e r t i e s then club would imply " c o n c r e t e " and not imply " c o n c r e t e " , which is a contradiction. Definition of Relations. R1.
Definition of "All" r e l a t i o n s :
"All w. a r e w." if there exists a PieWi and a p e w .
such that pjCTx(P k) ---> P i e T y ( P k ).
59 T h i s says that if Pi i m p l i e s e v e r y p r o p e r t y that pj i m p l i e s , then the set which contains Pi i m p l i e s the set which contains pj.
F o r example, if a m a m m a l contains the p r o p e r t y " m a m -
malian" which i m p l i e s the p r o p e r t i e s " f u r r y " and " a n i m a l " and dog contains the p r o p e r t y " d o g - l i k e " which i m p l i e s the p r o p e r t i e s " f u r r y " and " a n i m a l " and " b a r k s " , then a dog is a mammal.
A special c a s e of this definition is when Pi implies pj.
It follows f r o m the t r a n -
sitive nature of implication that Pi then i m p l i e s e v e r y p r o p e r t y which pj does.
For exam-
ple, "A c a n a r y is a bird" is true because the p r o p e r t y " c a n n a r y - l i k e " i m p l i e s the p r o p e r t y "bird-like". 1%2. Definition of "No" r e l a t i o n : 'rNo w.~ i s a Wm" if t h e r e e x i s t s PiCWi and PmCWm and Pk such that Pi c T(p')x• and pm E Tx(Pk ) and pi~Ty(Pm)_ and pm~Tz(Pi)._
This says that if w.1 and Wm both have p r o p -
e r t i e s which a r e subordinates on the s a m e concept t r e e , they a r e mutually exclusive.
For
example, a canary can not be a robin, since a bird can not be both a robin and a canary.
A
bird can not be a fish, since an animal can not be both a fish and a bird. R3. ~Definition of "Some" r e l a t i o n : " S o m e w.j a r e w."~ if there exists a PiCWi and pje wj such that p j e Tx(Pk)_ ---~ Pi¢ Tv(Pk}" This is the i n v e r s e of the " a l l " r e l a t i o n (R1). canary.
If a c a n a r y is a bird, then s o m e bird is a
If all pets a r e a n i m a l s , then s o m e animal is a pet. R4.
Extension of " S o m e " r e l a t i o n :
"Some w.1 is a wa" if there exists PiCWi and pnCWn and Pk such that pi e Tx(Pk)__ and Pn c Ty(Pk).
This can best be explained by example.
If s o m e animal is a pet by R3 and a
bird is an animal by R1, then since bird i m p l i e s animal and some animal is a pet, s o m e bird might b e a pet.
The c r u c i a l distinction here is that the p r o p e r t i e s of bird and pet a r e
r e l a t e d to the p r o p e r t y of animal under different concept t r e e s (T x and Ty). part of the s a m e concept t r e e , then R2 would apply. relations.
If they w e r e
Of c o u r s e , R3 and R4 define different
R3 defines the existence of something, while R4 only defines the possibility that
something might exist.
But this distinction is absent in n o r m a l English so it has been
glossed o v e r here. R5.
Definition of "Not a l l " relation:
"Not all w.] a r e Wn" if t h e r e exists PiCWi and PLOW.,J such that "All w i a r e w."j and PnC w n such that "No w. a r e w ". 1
n
This conjunction of R1 and R2 says that if a c a n a r y is a kind
of bird and a c a n a r y can not be a robin, then not all birds a r e robins.
Or, if t h e r e e x i s t s a
bird which is not a pet, then not all a n i m a l s a r e pets. The Acquisition of Semantic P r o p e r t i e s . The r e p r e s e n t a t i o n just d e s c r i b e d is g e n e r a t e d by adding new p r o p e r t i e s to concept trees.
Clearly, by the definitions of the r e l a t i o n s R1--R5, all logical r e l a t i o n s h i p s between
60 the property added and every other property in the network are automatically specified. Previously, the problem arose of how to infer abstract logical implication from the representation of perceptual features. But here logical implication is defined a priori, so the problem never arises. It only remains to be shown that this logical system can have perceptual referents. A simple network labelled with its perceptual referents is shown in Figure 3. Note that the property "elm" implies both the perceptual features which make an
percep/tuilm~tree ~
a ] ~ r e s t °f w°rld ~
fu:atq::e~o elm/ perceptual features unique to tree
perceptu i features common to tree and world
perceptual features unique to world
FIG. 3. Representation of How Logical Network Refers to Perceptual Data. elm unique and the property "tree", which implies the features which make Hence,
the property "elm" implies all the perceptual features of an "elm tree".
representation
could have been generated in the following manner.
which he wanted to distinguish from all other trees. 3) was attached to "tree".
Thus an elm is a tree.
Thus,
This
A person saw a tree
So a property (labelled "elm" in Figure Then an implication was drawn
"elm" to the perceptual features which an "elm" possesses trees.
a tree unique.
from
in addition to those unique to all
logical implication can be related to its normal
use in discriminating
percep-
tual classes. Disambiguation
Sentences.
The theory just described can be used to clear up problems where
a eomponential
represented
analysis has run into difficulty.
in other applications
For example,
Katz and Fodor (1963)
the properties defining the word bachelor by the tree structure shown in Figure 4.
In the tree in Figure i, the nouterminal various meanings
properties at the branching points of the tree, which
of bachelor have in common,
are called markers,
while the descriptions
in brackets at the bottom of the tree, which are unique to each meaning called distinguishers. is that it misses
The basic problem
certain generalizations.
certainly have something The academic titles bestowed
in common,
with ordering
meaning
The meanings
of unmated
upon them,
in a hierarchicha[
are fashion
seal and unmarried
but they are placed at the extreme
degree holder and young knight share in common
of bachelor,
man
ends of the tree.
the fact that they have had
but that fact is lacking from the tree.
But if the markers
were
61
bachelor noun
/
(male)
ho has the f i r s t or lowest academic degree
~
who has never married
young knight s e r v i n g under the standard of another knight
(mate) I young fur seal when without a mate during the breeding time
FIG. 4. : The Representation of the Meaning of B a c h e l o r by Katz and Fodor.
r e w r i t t e n and r e o r d e r e d to capture these g e n e r a l i z a t i o n s , then the ones p r e s e n t l y r e p r e s e n ted would be lost.
Though language meaning is tantalizingly h i e r a r c h i c a l , it is just c r o s s -
r e f e r e n t i a l enough to vitiate an attempt to capture meaning in s t r i c t h i e r a r c h i e s .
The r e p r e -
sentation of bachelor in this relationaUy defined theory is shown in F i g u r e 5. As can be seen
baciel°r3
bachelor
1\
m a l e seal
bachelor 2
/\/
unmated
unmarried
mate
knight
bachelor 4
\
man
noble title
a c a d e m i c title
human
FIG. 5. : The Representation of the Meaning of B a c h e l o r in the Relational Theory.
f r o m the figure, the relational theory is m o r e c r o s s - r e f e r e n t i a l in nature than the h i e r a r c h i c a l theory Katz and Fodor propose.
F u r t h e r , t h e r e is a natural way of dealing with the
disambiguation of a word in the context of a sentence.
Disambiguatiou can take place by
taking the i n t e r s e c t i o n s of the concepts a s s o c i a t e d with the p r o p e r t i e s defining the words in the sentence.
F o r example, for "the barking b a c h e l o r " , an i n t e r s e c t i o n is sought with
another concept t r e e which produces a logical relationship between a p r o p e r t y of the concept " b a r k " and a p r o p e r t y of bachelor.
T h e r e is c e r t a i n l y an i n t e r s e c t i o n between " b a r k " and
62 "seal" since a seal bark is a bark and a barking seal is a seal. "Baehelorl" is related to "seal" by R1 (a bachelor is a seal). Thus, by R4, "bachelor" is related to "barking seal" (a "bachelor" is a "seal" and some "seal" is a "barking seal"). Sincethe concept "bark" does not intersect any other concept tree of bachelor, the meaning is completely disambiguated. Thus, within the axioms of the theory, is a complete model of disambiguation. S.~atactic Form and Semantic Meaning The theory can also be applied to the study of the relationship between syntax and symantics. Sintactic rules can be defined as relations between properties, similar to R1-R5.
A s e n t e n c e would then be a c o l l e c t i o n of s e v e r a l s e t s of p r o p e r t i e s defining w o r d s with s o m e of t h e s e r e l a t i o n s defined between t h e i r p r o p e r t i e s .
The following i s a v e r y s i m p l e e x a m p l e
of this. The d i s t i n c t i o n between a n a l y t i c and s y n t h e t i c is well-known. is one which is t r u e by definition.
An a n a l y t i c s t a t e m e n t
F o r e x a m p l e , "All m e n a r e m a l e " is a n a l y t i c since p a r t
of the definition of being a man is b e i n g m a l e .
In c o n t r a s t , while the s t a t e m e n t "All m e n a r e
o v e r one inch tall" is n o n e t h e l e s s t r u e , it is a s y n t h e t i c s t a t e m e n t s i n c e b e i n g o v e r one inch tall i s not p a r t of the definition of m a n , and the s e n t e n c e can only be v e r i f i e d in r e f e r e n c e to the world.
T h i s s e m a n t i c f o r m of the a n a l y t i c - s y n t h e t i c d i s t i n c t i o n r e s t s not on the s y n t a c -
tic r e l a t i o n s h i p of the w o r d s in the s e n t e n c e but s i m p l y on t h e i r m e a n i n g s . second, s y n t a c t i c f o r m of the a n a l y t i c - s y n t h e t i c d i s t i n c t i o n in E n g l i s h . the s y n t a c t i c r u l e s which g o v e r n the c o n s t r u c t i o n of the s e n t e n c e .
But t h e r e is a
T h i s r e s t s solely on
To s e e this, note t h a t
s e n t e n c e (i) i s s o m e h o w odd, o r p e c u l i a r , o r u n g r a m m a t i c a l . (i) *A r o o m m a t e is a w r i t e r . But s e n t e n c e s (ii) and (iii) a r e p e r f e c t l y a c c e p t a b l e . (ii) My r o o m m a t e is a w r i t e r . (iii) A r o o m m a t e i s a p e r s o n . T h e r e s e e m s to be s o m e t h i n g a b o u t the f o r m of (i) t h a t c o m p e l s i t s i n t e r p r e t a t i o n a s a u n i v e r s a l a s s e r t i o n , i n d e p e n d e n t l y of the m e a n i n g of the w o r d s c o n c a t e n a t e d . so, s o m e r u l e s of s e n t e n c e f o r m a t i o n m u s t be specified.
To s e e why t h i s is
The r u l e s a r e given in e x t r e m e l y
s i m p l i f i e d f o r m , with m o s t of the d e t a i l s left out s i n c e they a r e not r e l e v e n t to this e x a m p l e , S1.
The c o n s i s t e n c y r u l e .
Syntactic r u l e s will be u s e d to define new r e l a t i o n s between p r o p e r t i e s .
But if new i m p l i c a -
tions a r e to be d r a w n between p r o p e r t i e s , they c a n not c o n t r a d i c t the ones t h a t a l r e a d y e x i s t . It follows not only f r o m t h i s but any f o r m a l m o d e l , t h a t a s t r u c t u r e w h i c h l e a d s to a logical c o n t r a d i c t i o n i s ill f o r m e d .
T h i s r u l e m a y be s t a t e d : for all Pi and pj c o n t a i n e d in P, i f
pj i m p l i e s Pi o r pj and Pi i m p l y Pk' then Pi can not i m b l y pj.
63 S2.
"A(n)" operator.
A syntactic rule has two parts to it. One part expresses or which should be generated between two properties, rules specified relations between properties.
a relationship which should exist
the same
way the earlier relation
The other part tells what words
these proper-
ties are associated with by specifying the form of the word and where
in the sentence it may
be found.
Pi -->Pa where
For example,
the "A(Q)" operator defines an implication:
Pa is a
p r o p e r t y of the s e t defining __a(n)and Pi i s a p r o p e r t y of a w o r d w.1 following a(n) in the sentence. $3.
The " I s " o p e r a t o r .
The p r e s e n c e of i s in a s e n t e n c e defines an i m p l i c a t i o n : P i - - > P j w h e r e PiCWi which p r e c e d e s i s and p i - - > p a ,
and p . ¢ w. w h e r e w. defines a w o r d w h i c h follows is.
--
j
}
In t r a d i t i o n a l
J
grammatical terms,
w. will be the noun and a(n) will be the d e t e r m i n e r and the s t r u c t u r e 1 that c o n t a i n s P i - ' > P a will be the noun p h r a s e . T h u s , 83 s a y s that in a s e n t e n c e of this type, the noun p h r a s e i m p l i e s i t s p r e d i c a t e .
We have s e e n f r o m o u r t h r e e e x a m p l e s t h a t t h i s i s
true. By a p p l i c a t i o n of $2 to the p h r a s e a r o o m m a t e , a p p l i c a t i o n of $3 to the p h r a s e a r o o m m a t e i s a w r i t e r , F r o m the definition of R t ,
Proommate---> Pa i s defined.
By
P r o o m m a t ¢ - - > P w r i t e r is defined.
t h i s g i v e s "All r o o m m a t e s a r e w r i t e r s " .
But if the l i s t e n e r h a s
s t o r e d a p r o p e r t y i m p l y i n g P r o o m m a t e and s h a r i n g a c o n c e p t with P w r i t e r so that by R5 the l i s t e n e r knows "Not all r o o m m a t e s a r e w r i t e r s " , then a c o n t r a d i c t i o n e x i s t s and by S1 the s e n t e n c e m u s t be ill f o r m e d . S e m a n t i c T h e o r y and P s y c h o l o g i c a l R e a l i t y The b a s i c e x p e r i m e n t a l p a r a d i g m to w h i c h t h i s t h e o r y will be fitted w a s d e v e l o p e d s i m u l t a n e o u s l y by L a n d a u e r and F r e e d m a n (1968) and Collins and Quillian (1969).
A subject
i s f i r s t p r e s e n t e d with a s e m a n t i c c a t e g o r y , such a s b i r d , a n d then a s e c o n d w o r d w h i c h m a y o r m a y not be an i n s t a n c e of that c a t e g r o y .
The s u b j e c t p r e s s e s a button l a b e l l e d t r u e if the
i n s t a n c e w o r d i s a w o r d like c a n a r y , and a button l a b e l l e d f a l s e if the w o r d is a w o r d like rock.
The d e p e n d e n t m e a s u r e is how long it t a k e s the s u b j e c t to r e s p o n d f r o m the o n s e t of
the i n s t a n c e word.
A s e c o n d way t h i s t a s k i s done i s to p r e s e n t the e n t i r e a s s e r t i o n a s a
s e n t e n c e : "A c a n a r y i s a b i r d " and m e a s u r e r e a c t i o n t i m e f r o m the o n s e t of the a s s e r t i o n . T h e r e have been no i n t e r e s t i n g d i f f e r e n c e s r e p o r t e d f r o m v a r y i n g the f o r m of the t a s k (Kintach, e t al, 1970) but the second v e r s i o n of the t a s k i s s l i g h t l y m o r e g e n e r a l . e x a m p l e , one can a l s o p r e s e n t a s e n t e n c e w h i c h r e a d s "A c a n a r y h a s w i n g s " .
For
However,
though s e n t e n c e s of t h i s type a r e often r e p o r t e d to follow the s a m e g e n e r a l p a t t e r n of e x p e r i m e n t a l r e s u l t s as t h o s e w h e r e the a s s e r t i o n s a r e r e s t r i c t e d to the s e t - i n c l u s i o n type (All A
64 a r e B; Some A a r e B), t h e r e a r e many c o n t r a d i c t i o n s in the data r e p o r t e d for them.
Since
it is not known why the data f o r t h e s e s e n t e n c e s i s u n c l e a r , they will not be d i s c u s s e d . The initial r e s u l t s found d e m o n s t r a t e d that t h e r e w e r e r e l i a b l e d i f f e r e n c e s in the time it took to r e s p o n d t r u e and f a l s e to d i f f e r e n t a s s e r t i o n s .
In g e n e r a l , it w a s found that a s e n -
fence of the type (1) "A c a n a r y is a b i r d " is r e s p o n d e d to f a s t e r than a s e n t e n c e of the type (2) "A c a n a r y i s an o r g a n i s m " .
A t f i r s t this w a s thought to r e f l e c t s o m e t h i n g about the l o g i -
cal f o r m in which the m e a n i n g s of the w o r d s w e r e s t o r e d .
F o r e x a m p l e , it w a s though that
(t) was r e s p o n d e d to f a s t e r than (2) b e c a u s e in o r d e r to r e s p o n d to (2) the s u b j e c t had to make m o r e i n f e r e n c e s . c a n a r y ---> bird.
F o r (l), the s u b j e c t would have s t o r e d d i r e c t l y the i m p l i c a t i o n :
But for (2) the s u b j e c t would have to s e a r c h through a n e t w o r k of i m p l i c a -
t i o n s : canary---> b i r d - - > . . . --->o r g a n i s m .
However, s i n c e then, s u b s t a n t i a l e v i d e n c e has
a c c u m u l a t e d that r e a c t i o n t i m e is not c o r r e l a t e d with any m e a s u r e of a chain of logical i m p l i c a t i o n s , but with the intuitive s e m a n t i c d i s t a n c e between two w o r d s (Rips, Shobea and Smith, 1972). than a ~
F o r e x a m p l e , a p e r s o n is much m o r e likely to think of a dog a s an animal
as a mammal.
Do~ and animal a r e intuitively c l o s e .
If a s u b j e c t is a s k e d to
r e s p o n d to (1) "A dog is an a n i m a l " and (2) "A dog is a m a m m a l " , (1) is f a s t e r than (2) in s p i t e of the fact that the chain of logical i m p l i c a t i o n s g o e s d o g - m a m m a l - a n i m a l .
Semantic
d i s t a n c e s c a l e s can be c o n s t r u c t e d by s i m p l y asking s u b j e c t s to rank what w o r d s a r e i n t u itively c l o s e t o g e t h e r o r ( H e i d e r , 1972) by asking t h e m to r a t e good and bad i n s t a n c e s of a particular category.
R e a c t i o n t i m e c o r r e l a t e s c l o s e l y with intuitive d i s t a n c e on t h e s e s c a l e s
and the s c a l e s c o r r e l a t e c l o s e l y with e a c h o t h e r .
It s e e m s that w h e t h e r the question is how
c l o s e the i n s t a n c e is to the c a t e g o r y , o r how good an e x a m p l e it is of that c a t e g o r y , the s a m e q u e s t i o n is r e a l l y being asked.
When logical d i s t a n c e is held c o n s t a n t (A c a n a r y is a b i r d
vs. A chicken i s a bird) the b e t t e r i n s t a n c e of the c a t e g o r y (canary) i s r e s p o n d e d to f a s t e r . Semantic d i s t a n c e is c o r r e l a t e d with conjoint f r e q u e n c y and a s s o c i a t i v e propability.
Con-
joint f r e q u e n c y i s a w o r d count m e a s u r e of how f r e q u e n t l y two w o r d s a p p e a r t o g e t h e r in the language.
A s s o c i a t i v e p r o p a b i l i t y i s the f r e q u e n c y with which one w o r d e l i c i t s the o t h e r a s
a response.
It is r e a s o n a b l e to find that t h e s e m e a s u r e s a r e c o r r e l a t e d with intuitive d i s -
tance, since if w o r d s a r e found t o g e t h e r one would e x p e c t t h e m to be thought of t o g e t h e r , and if w o r d s a r e thought of t o g e t h e r , then one would e x p e c t e t h e m to be p r o d u c e d t o g e t h e r . However, the p r e c i s e m e c h a n i s m of the c a u s e - e f f e c t r e l a t i o n s h i p between acquisition, i n tuition, and production i s still not known.
But all such m e a s u r e s c o r r e l a t e well with r e -
a c t i o n - t i m e m e a s u r e s , to the d e t r i m e n t of logical d i s t a n c e m o d e l s . s u m m a r i z e d as follows.
The b a s i c data m a y be
F o r s t a t e m e n t s which a r e t r u e , the m o r e intuitively s i m i l a r the
c a t e g o r y and i n s t a n c e a r e , the f a s t e r the r e s p o n s e .
F o r s t a t e m e n t s w h i c h a r e f a l s e , the
65
more
intuitively similar the category and instance are, the slower the response.
example,
"A canary is a dog" is responded
In psychology,
to slower than "A canary is a flower".
there is a peculiar distinction between what might be called empirical
validity versus explanatory adequacy.
For example,
a way of handling the true/false data
just presented would be to postulate that two separate processes whether an instance is a member
of a particular category.
are involved in verifying
One of these processes
tive when there is no overlap between the properties of the words are effective where
there is overlap.
results.
said to have empirical validity, since it predicts experimental
to show,
but when they have been proposed,
in a noncircular manner,
which are labelled "set-relation".
"canary".
and both
Such a model would be
results.
Such models
For example, Then,
have
not the slightest attempt has been made
how the logical relationships between the words
inferred from the properties found.
for a path labelled "set-relation"
in the assertion,
is effec-
It is possible to contrive a multiple, serial, set-
search model that accounts for most of the experimental
been proposed,
For
paths between nodes may
are
be defined
to verify that a canary is a bird, one would look
running from a node labelled "bird" to a node labelled
Coding an English sentence as a labelled diagram
certainly does not constitute an
explanation of it. Since such a theory really does not constitute an explanation of how a logical decision is made,
it lacks explanatory adequacy.
The fact that the theory presented
here has attempted to deal with the question of explanatory adequacy the other semantic reaction time models
in psychology.
distinguishes it from
It will now be shown to be empiri-
cally valid as well. The approach
that will be taken here is that what has been called intuitive distance
or intuitive similarity is the causal factor underlying the differences in reaction-time responding to different assertions.
in
So it will first be shown how the theory can be made
account for semantic distance, and how that manipulation
to
also accounts for reaction-time
results. The person who has most thoroughly discussed semantic distance is Eleanor Heider (1972).
She points out that a word like bird often implies not only the properties of all birds,
but the properties which most birds share.
In other words,
feathered animal, which lays eggs and sings. of instances of birds. much
more
For example,
bird usually refers to a srrmll,
These can all be represented
as properties
the sentence "the birds were flying through the air" is
likely than the sentence "the birds were running across the plain".
ostrich, it is the second sentence which is true.
But for an
It appears that instances intuitively close
to the category bird share most of the properties it subtly connotes.
For example,
sparrow,
robin, wren,
and canary can all be described adequately as small feathered animals which
fly and sing.
A few additional properties,
such as "yellow" for canary,
may
define each
66 b i r d uniquely, but t h e s e p r o p e r t i e s a r e additive, not a l t e r n a t i v e , to the ones m e n t i o n e d . But a bad i n s t a n c e , such a s o s t r i c h , r e q u i r e s m a n y additional p r o p e r t i e s in i t s definition, s i n c e it is l a r g e , does not fly, a n d does not sing. fly, and i s r a i s e d f o r eggs and m e a t .
S i m i l a r l y , a c h i c k e n c a c k l e s , d o e s not
T h u s , the m e a s u r e of i n t u i t i v e s e m a n t i c d i s t a n c e will
b e how m a n y additional p r o p e r t i e s it t a k e s to define the i n s t a n c e o v e r the p r o p e r t y w h i c h defines the c a t e g o r y .
F o r e x a m p l e , if a c a n a r y is defined a s a "yellow" " b i r d " and an
o s t r i c h r e q u i r e s t h r e e additional p r o p e r t i e s ( l a r g e , nonfiying, nonsinging, bird) to c a n a r y ' s one, then c a n a r y is i n t u i t i v e l y c l o s e r to b i r d . Though a word was defined a s a s e t of p r o p e r t i e s , so f a r w i h a s been t r e a t e d a s a o n e - e l e m e n t set.
In o r d e r to explain s e m a n t i c d i s t a n c e , a word will now be t r e a t e d a s a
multi-element set containing all the properties it logically implies.
For example, instead
of mammal being defined by the set containing the property "mammal", mammal will be defined by the set consisting of "furry", "animal", etc., which "mammal" logically implies. These two descriptions can be related by defining the sum of the branches of a property B(Pi) as the set of properties such that pj c B(Pi) if Pi --'>Pj" The "furry" and "animal" are the branches of "mammal". The semantic distance between two words defined by B(w.) and i
B(wj) can now be defined by the following formula: Intuitive Distance (lw., w.) = b+ ac I
]
where a is the number of properties in Va and b is the number of properties in vb and c is the number of properties in v . C
pi wi , (pj wj) Pa~Va
if
Pb Vb
if
PeCVc if
pi Tx(Pa)A (pj ¢ Ty(Pa) ~,,pa ¢ wj )
(pbcB(pi)ApbCB(p?)V(pbcB(p?^pb¢(pi) PieTx(Pc)ApjeTx(Pe )
F o r a word p a i r like c a r d i n a l / b l u e jay, v a c o n s i s t s of all the p r o p e r t i e s which have a t r e e c o n t a i n i n g a p r o p e r t y of w with t h e m .
1
and a n o t h e r t r e e c o n t a i n i n g a p r o p e r t y of w. a s s o c i a t e d j
T h e s e a r e p r o p e r t i e s like " f e a t h e r e d " , " b e a k e d " , " t a l o n e d " , etc.
vb consists
of p r o p e r t i e s not in c o m m o n : such a s the N e t t h a t a c a r d i n a l i s a s p o r t ' s e m b l e m ,
v
conc s i s t s of p r o p e r t i e s w h i c h do d i s c r i m i n a t e the s e t s , s u c h a s the p r o p e r t y " c o l o r e d ' , s i n c e both
" r e d " (for e a r d i n a l ) and " b l u e " (for bluejay) a r e m e m b e r s of the s a m e c o n c e p t t r e e " c o l o r e d " and hence, by R2, m u t u a l l y e x c l u s i v e a l t e r n a t i v e s .
F o r a w o r d p a i r like c a r d i n a l / b i r d the
67
p r o p e r t y " r e d " would be in Vb, s i n c e b i r d does not i m p l y any c o l o r , and v It follows f r o m the definition of " A l l " t h a t w
would be empty. c m u s t be e m p t y w h e n e v e r " A l l " is t r u e . Also,
e if a p r o p e r t y in c a r d i n a l i m p l i e s a p r o p e r t y in b i r d , such a s " b i r d - l i k e " , then " b i r d - l i k e "
g o e s into v . The f o r m u l a for i n t u i t i v e d i s t a n c e : the r a t i o of the n u m b e r of p r o p e r t i e s the a w o r d s h a v e in c o m m o n (v a) to the n u m b e r of p r o p e r t i e s n o t held in c o m m o n (v b) plus the p r o p e r t i e s logically d i s t i n g u i s h i n g the w o r d s (v e) follows c l o s e l y the p r e v i o u s d i s c u s s i o n of what the u n d e r l y i n g b a s i s of intuitive d i s t a n c e could be, The r e l e v e n t p a r a m e t e r f o r p r e d i c t i n g r e a c t i o n t i m e is the p e r c e n t a g e of p r o p e r t i e s in the union of the s e t s B(w i) and B(wj) on which a d e c i s i o n about the r e l a t i o n s h i p between the two w o r d s can be b a s e d .
T h i s s t e m s f r o m the a s s u m p t i o n t h a t the union of the w o r d - s e t s
i s s e a r c h e d for a p r o p e r t y on which to m a k e a d e c i s i o n a b o u t t h e i r r e l a t i o n s h i p .
W h e r e the
p e r c e n t a g e of such p r o p e r t i e s i s l a r g e r , the p r o b a b i l i t y of finding one is g r e a t e r and the a v e r a g e t i m e to make a d e c i s i o n should be s h o r t e r . c a r d i n a l i s a b i r d " , Vc will be empty.
In the c a s e of a t r u e s t a t e m e n t like "A
The l a r g e r v a i s , the f a s t e r a d e c i s i o n will be
r e a c h e d ; but by definition, the l a r g e r v a i s the c l o s e r the two w o r d s will be i n t u i t i v e l y . Thus, for t r u e s t a t e m e n t s , the c l o s e r the w o r d s a r e i n t u i t i v e l y , the f a s t e r the r e a c t i o n - t i m e . F o r f a l s e s t a t e m e n t s , like "A c a r d i n a l i s a b l u e j a y " , the r e a c t i o n t i m e will depend on the p e r c e n t a g e of p r o p e r t i e s in v . But w h e r e w o r d s a r e i n t u i t i v e l y c l o s e , and v is l a r g e , v c a e will be p r o p o r t i o n a l l y s m a l l . T h u s , the c l o s e r the intuitive d i s t a n c e for f a l s e s t a t e m e n t s , the s l o w e r the r e a c t i o n t i m e . It would be nice to have s o m e m o r e e v i d e n c e for the e x i s t e n c e of v a, v b, and v cSuch e v i d e n c e e x i s t s .
M e y e r (1970) had s u b j e c t s r e s p e n d t r u e o r f a l s e to s u c h s t a t e m e n t s a s
(1) "All s t o n e s a r e r u b i e s " , (2) "All m o t h e r s a r e w r i t e r s " ,
(3) "All typhoons a r e w h e a t s "
and (4) "Some s t o n e s a r e r u b i e s " , (5) "Some m o t h e r s a r e w r i t e r s " and (6) "Some typhoons a r e wheat". (2) and (3).
T h e r e a r e two p o s s i b l e ways a d e c i s i o n to r e s p o n d f a l s e could be r e a c h e d in (1), One way is t h a t , f o r e x a m p l e , a Pb • B ( r u b i e s ) could be found so t h a t the r e -
q u i r e m e n t of the "All" r e l a t i o n t h a t all Pk i m p l i e d by P r u b i e s a r e i m p l i e d by Pstone could not be s a t i s f i e d .
T h e o t h e r way is t h a t , f o r e x a m p l e , a Pc f o r a n i n s t a n c e of m o t h e r and
w r i t e r could be found so t h a t the r e q u i r e m e n t s of the "Not a l l " r e l a t i o n sould be s a t i s f i e d . It does not m a t t e r w h i c h p r o p e r t y is found s i n c e p r e d i c t i o n s about the s p e e d of r e a c t i o n t i m e a r e b a s e d on the r a t i o b + c / a and a r e thus i n d e p e n d e n t of w h e t h e r the falsifying p r o p e r t y is a Pb o r Pc'
C l e a r l y , s t o n e / r u b y a r e i n t u i t i v e l y c l o s e r t h a n m o t h e r / w r i t e r , which a r e i n -
t u i t i v e l y c l o s e r t h a n t y p h o o n / w h e a t : so (t) should be s l o w e r t h a n (2) w h i c h should be s l o w e r t h a n (3).
The actual a v e r a g e r e a c t i o n t i m e s w e r e 1339 m i l l i s e c o n d s ( m s e c . ) f o r (1), 1263
m s e c . for (2) and 1154 m s e c . f o r (3), w h i c h a r e highly s i g n i f i c a n t d i f f e r e n c e s (p < . 001). T h e r e s u l t s a r e exactly as predicted.
68
For "Some ve,
typhoons are wheats"
the false decision still rests on a property in v b or
so the reaction time for it should not differ from
time of 1115 msee.
the "All 'T statement°
does not differ significantly (p . i0) from
stones are rubies" and (5) "Some
mothers
finding a pa o Clearly,
is greater than b'+c'/a',
than b+c/a.
Thus
if b+c/a
are writers"
1154 rose.
properties
then a'/b'+c'
the theory predicts that (4) will now be faster than (5).
in common
and for (5), 1108 msec., msec.
Thus, 1350
But for (4) "Some
a decision will be arrived at by
tively sound to expect that (5) will be faster than (2), since mother/human more
The measured
than not in common.
will be greater It is also intuiintuitively has
The reaction times are, for (4), 1017 msee.
which is significantly faster (p .01) than the time for (2), 1263
once again all predictions
are confirmed
(see Fig. 6).
ALL
1300 1250 1200
1150 1 i00 1050 i000
/
J SOME
950
stone/ruby
mother/writer
typhoon/wheat
FIG. 6. R e a c t i o n T i m e R e s u l t s f r o m M e y e r (1970). T h e r e is a l s o e v i d e n c e that the "All" and " S o m e " r e l a t i o n s a r e c o r r e c t l y defined. An "All" d e c i s i o n c a n depend on finding s e v e r a l p r o p e r t i e s in Pa' but for a " S o m e " d e c i s i o n only a single p r o p e r t y n e e d be found in Pa" s l o w e r than "Some c h a i r s a r e f u r n i t u r e " .
T h u s , "All c h a i r s a r e f u r n i t u r e " should be T h e i r t i m e s a r e 1182 m s e c . and 99o m s e e .
(p < . 001), r e s p e c t i v e l y . Conclusion T r a d i t i o n a l c o m p o n e n t i a l a n a l y s i s h a s b e e n applied to a wide r a n g e of s e m a n t i c problems,
In t h i s p a p e r logical i m p l i c a t i o n h a s b e e n p r o p o s e d a s a n a l t e r n a t i v e to s e t -
i n c l u s i o n a s the p r i m i t i v e out of which m e a n i n g is built,
t t h a s b e e n shown to apply to a n
equally wide r a n g e of p r o b l e m s a s t h e o r i e s utilizing s e t - i n c l u s i o n , but with the p o s s i b i l i t y of e v e n g r e a t e r s u c c e s s .
The t h e o r y i s potentially a p p l i c a b l e to the study of logic and syntax,
of language a c q u i s i t i o n , and the i n v e s t i g a t i o n of the o r g a n i z a t i o n of m e m o r y t h r o u g h r e a c t i o n time.
69 Acknowledgment Part of the work on this paper was supported by a grant from the Undergraduate Research Council of the State University of New York at Buffalo. I would like to thank John Anderson and Gordon Bower for their time and effort in reading and commenting on the many versions of this paper. References Bollinger, D. (1965), "The Atomization of Meaning", Language, 41__, 555-573. Collins, A.M. and M.R. QuiUtan (1969), "Retrieval Time from Semantic Memory", Journal of Verbal Learning and Verbal Behavior, , 24-248. Heider, E.R. (in press), "On the Internal Structure of Perceptual and Semantic Categories", in T.M. Moore (ed.) Cognitive Development and Acquisition of Language, New York, Academic P r e s s . Katz, J . J . and J. Fodor (1963), "The Structure of a Semantic Theory", Language, 39__,, 170-210. Kintsch, W., E. Crothers and L. Berman (1970), "The Effects of Some Semantic and Syntactic Properties of Simple Sentences upon the Latency of Judgements of Semantic Acceptability", in Studies in Mathematical Learning Theory and Psycholingnistics, The University of Colorado. Landauer, T.K. and J . L . Freedman (1968), "Information Retrieval from Long-Term Memory: Category Size and Recognition Time", Journal of Verbal Learning and Verbal Behavior, 7, 29t-295. Lyons, J. (1969), Introduction to Theoretical Linguistics, London, Cambridge University Press. Meyer, D.E. (1970), "On the Representation and Retrieval of Stored Semantic Information", Cognitive Psychology, 1_, 242-300. Rips, L . J . , E.J. Shoben and E . E . Smith (1972), "Semantic Distance and the Verification of Semantic Relations", unpublished manuscript. Schaeffer, B. and R. Wallace (1970), "The Comparison of Word Meanings", Journal of Experimental Psychology, _~6, 144-152. Schank, R.C. (1971), "Intention, Memory, and Computer Understanding", Stanford Artificial Project Memo AIM-140. Wilkins, A.T. (197t), "Conjoint Frequency, Categroy Size, and Categorization Time", Journal of Verbal Learning and Verbal Behavior, 10__,382-385. Winograd, T. (1972), "Understanding Natural Language", Cognitive Psychology, 3, 1-191.
STRUCTURED-STORAGE AFA Armen Gabrielian Seymour G i u s b u r g U n i v e r s i t y of Southern C a l i f o r n i a Abstract Among the v a r i o u s types of s t r u c t u r e s u s e d f o r s t o r i n g and r e p r e s e n t i n g data t h e r e a r e n u m e r o u s n o n l i n e a r types, e . g . ,
t r e e s (Samuel, 1959), linked s t r u c t u r e s (Newell and
Simon, 1956), and n - d i m e n s i o n a l a r r a y s ( H a r t m a n i s and S t e a r n s , 1965); n e v e r t h e l e s s , m o s t t h e o r e t i c a l m o d e l s of c o m p u t a t i o n a d h e r e to the tape m o d e l of s t o r a g e s t r u c t u r e , e . g . , T u r i u g a c c e p t o r s , pushdown a c c e p t o r s , and s t a c k a c e e p t o r s .
C u s t o m a r i l y , the n o n l i n e a r
types a r e l i n e a r i z e d so that the i n f o r m a t i o n s t o r e d in t h e m is r e p r e s e n t e d on a tape. e v e r , t h i s r e p r e s e n t a t i o n m a y be u n s u i t a b l e for v a r i o u s r e a s o n s .
How-
F o r e x a m p l e , in the c a s e
of l i n e a r coding of o r g a n i c c o m p o u n d s , d i f f i c u l t i e s a r i s e with unique r e p r e s e n t a b i l i t y and decodability.
P e r h a p s the m o s t s e r i o u s d i s a d v a n t a g e of l i u e a r i z a t i o n is that it c o m p l i c a t e s
the p e r f o r m a n c e of n a t u r a l l y and s t r u c t u r a l l y d e p e n d e n t o p e r a t i o n s on t h e data. In r e c e n t y e a r s m u c h of the r e s e a r c h on f o r m a l l a n g u a g e s h a s b e e n within the f r a m e w o r k of A F L t h e o r y ( G i u s b u r g and G r e i b a c h , 1969), i . e . , of f o r m a l l a n g u a g e s c a l l e d " A F L " ,
the study of c e r t a i n f a m i l i e s
S i m i l a r l y , m u c h of the r e s e a r c h on a c c e p t i n g d e v i c e s
h a s been m a d e within the f r a m e w o r k of AFA t h e o r y ( G i n s b u r g and G r e i b a e h , 1969), i . e . , the study of c e r t a i n f a m i l i e s of one-way, n o n d e t e r m i n i s t i c , single s t o r a g e tape a e c e p t o r s called "AFA".
It is known that, in a n a t u r a l m a n n e r , AFA give r i s e to A F L and, c o n v e r s e l y ,
A F L give r i s e to AFA.
In A F A theory, s e v e r a l a l t e r n a t i v e s to the single tape s t o r a g e s t r u c -
t u r e of a e c e p t o r s have been c o n s i d e r e d .
F o r e x a m p l e , n e s t e d m u l t i t a p e A F A a r e u s e d in
G r e i b a e h and G i n s b u r g (1972) to give a d e v i c e - c h a r a c t e r i z a t i o n of the s u b s t i t u t i o n of one full A F L into a n o t h e r .
A g e n e r a l i z a t i o n of this is u s e d in G r e i b a c h (1970) to give a
c h a r a c t e r i z a t i o n of n e s t e d i t e r a t e d s u b s t i t u t i o n - c l o s e d full A F L .
In e a c h of t h e s e c a s e s ,
l i n e a r i z a t i o u is e m p l o y e d to show t h a t c e r t a i n f a m i l i e s of a c c e p t o r s with g e n e r a l i z e d s t o r a g e s t r u c t u r e a r e equivalent, f r o m the point of view of l a n g u a g e s defined, to o r d i n a r y AFA, i . e . , the s i n g l e - t a p e kind.
The p u r p o s e of t h i s p a p e r is to i n t r o d u c e a c l a s s of f a m i l i e s of a c c e p -
t o t s c a l l e d " s t r u c t u r e d - s t o r a g e A F A " ( a b b r e v i a t e d "SS-AFA") in w h i c h the a u x i l i a r y s t o r age is of a v e r y g e n e r a l f o r m .
Indeed, the a u x i l i a r y s t o r a g e is g e n e r a l enough so that SS-
AFA include o r d i n a r y AFA a n d d i f f e r e n t kinds of m u l t i t a p e AFA, a s well a s v a r i o u s f a m i l i e s of a c c e p t o r s obtained by i m p o s i n g g e o m e t r i c a l o r g r a p h i c a l s t r u c t u r e s on the a u x i l i a r y
storage.
71 The p a p e r i s divided into t h r e e s e c t i o n s .
Section 1 i n t r o d u c e s SS-AFA.
Section 2
e s t a b l i s h e s the b a s i c fact that, f r o m the point of view of defining l a n g u a g e s , SS-AFA a r e e q u i v a l e n t to o r d i n a r y AFA.
( T h i s r e s u l t e l i m i n a t e s the need to e m p l o y the l i n e a r i z a t i o n
p r o c e s s e a c h t i m e a new SS-AFA is e n c o u n t e r e d . )
Section 2 a l s o e x a m i n e s the effect of
i m p o s i n g c e r t a i n f i n i t e n e s s conditions on the s t o r a g e s t r u c t u r e of SS-AFA.
Section 3 c o n -
s i d e r s a v a r i e t y of d i f f e r e n t e x a m p l e s of SS-AFA, e a c h of w h i c h e i t h e r is a l r e a d y in the l i t e r a t u r e o r p o s s e s s e s a s t o r a g e s t r u c t u r e of s o m e p r o m i n e n c e .
In view of the n u m e r o u s
s p e c i a l i n s t a n c e s of SS-AFA, it i s r e a s o n a b l e to e x p e c t t h a t the placing of a p p r o p r i a t e r e s t r i c t i o n s on SS-AFA will be a useful tool in o b t a i n i n g new c l a s s e s of a c c e p t o r s and c o r r e sponding families of l a n g u a g e s . References G i n s b u r g , S. a n d S.A. G r e i b a c h (1969), " A b s t r a c t F a m i l i e s of L a n g u a g e s " , in Studies in A b s t r a c t F a m i l i e s of L a n g u a g e s , M e m o i r s of the A m e r i c a n M a t h e m a t i c a l Society, No. 87, 1-32. G r e i b a c h , S.A. (1970), " F u l l A F L ' s a n d N e s t e d I t e r a t e d S u b s t i t u t i o n " , I n f o r m a t i o n and and Control, 16, 7-35. G r e i b a c h , S.A. and S. G i n s b u r g (1972),"Multitape A F A " , J. A . C . M . ,
to a p p e a r .
H a r t m a n i s , J. and R . E . S t e a r n s (1965), "On the Computational Complexity of A l g o r i t h m s " , T r a n s . A m e r . Math. Soc., 117, 205-306. Newell, A . P . and H.A. Simon (1956), " T h e Logic T h e o r y M a c h i n e : A Complex I n f o r m a t i o n P r o c e s s i n g S y s t e m " , IRE T r a n s . IT ~ 2, 61-79. Samuel, A . L . (1959), " S o m e Studies in M a c h i n e L e a r n i n g U s i n g the G a m e of C h e c k e r s " , IBM J. R e s e a r c h and D e v e l p p m e n t , 3_, 211-229.
PREDICATE
CALCULUS
FEATURE
GENERATION
David Rothenberg University College, Rutgers University Abstract A summary description (proof of theorems omitted): An adaptive pattern representation and recognition strategy for application to mechanized interpretation of (sampled) pictorial data (other applications are appropriate) is described. The system generates its own features which are formulae in a subset of the weak (in the sense that only quantification over finite sets is permitted) second order predicate calculus. The models of such formulae define the "objects" in a description of the data, which is hierarchical both with respect to features and extensions. The hierarchy is automatically constructed, thereby implementing changes in "problem representation". Relations between the syntax and semantics of formulae in the weak second order predicate calculus a r e derived (by extending the syntax of the calculus) and utilized. Minimal use is made of the finiteness of the input data by the methods employed. That is, in pictorial pattern recognitions, the adaptive feature generation (i. e . , "learning") algorithms are independent of the fineness of grain of the sampling of an input picture. Because this approach is used, many difficult problems of a purely mathematical nature acquire practical importance. Computation is reduced through the use of topological methods and the system is at present in a stage of development appropriate for programming and use in a variety of practical applications. 1. The Problem The problem definition used conforms well to the theoretical framework proposed by Banerji (1969, 9-16, 103-175): From a finite set of points, U ={Xl,X 2 . . . . . Xn}, two 1 disjoint collections, K and ~, of given subsets of U (called regions) are given, That is, if "R." denotes a region in ~ and 1
"R." a region in C, ]
={RI'R2 ..... Rn} = (%+i'%+2 ..... %+M} ViVj(R i ~ Rj) when R i e K and R.] ¢ ff . A formula in the weak second order predicate calculus, P(A), {called an ideal predicate or ideal feature) must be generated which is strongly satisfied by all regions and by no region R. in ~. J
R. in K, 1
We define a formula as being strongly satisfied by a region if it
i s satisfied by that region and is a proper subset of no other region which satisfies the 1
This, of course, is easily generalized to n distinct collections.
73 formula.
(Of c o u r s e , a f e a t u r e can have only one f r e e (set) v a r i a b l e ("A" in "P(A)"~ )
T r i v i a l l y , s u c h a f o r m u l a c a n be a d i s j u n c t i o n of the c o n j u n c t i o n of (the m e m b e r s h i p s of) all points of U (i. e . , " c o n s t a n t s " ) in e a c h s e t in the c o l l e c t i o n K.
However, the " s h o r t e s t "
p o s s i b l e f o r m u l a ( B a n e r j i , 1969, 103-104) is sought: F r o m a g i v e n s e t of u n a r y and n - a r y a t o m i c p r e d i c a t e s (all s e q u e n c e s of points in U which s a t i s f y e a c h of t h e s e is given), a f o r m u l a is c o n s t r u c t e d in which both the n u m b e r of c o n s t a n t s (specific points i n U) and v a r i a b l e s (both point and set) a r e m i n i m a l .
(This definition of " s h o r t n e s s " s o m e w h a t
r e s e m b l e s t h o s e developed by K o l m o g o r e v and d i s c u s s e d in L~fgren (1967) and Solmonoff (1964a, b). ) Such a s u b s t i t u t i o n of a f o r m u l a c o n t a i n i n g quantified v a r i a b l e s for a f o r m u l a c o n t a i n i n g a l a r g e n u m b e r of c o n s t a n t s (but no quantified v a r i a b l e s ) t e n d s to r e s u l t in the s a t i s f a c t i o n of the f o r m u l a by s e t s not in any of the c o l l e c t i o n s .
Hence, t h e f o r m u l a is
s a i d to g e n e r a l i z e ( B a n e r j i , 1969; 104, 157, 168, 1 7 5 ) t h e e x p r e s s i o n w h i c h i n v o l v e s only constants. A c t u a l l y t h e p r e d i c a t e c a l c u l u s syntax is h e r e e x t e n d e d to include a modified q u a n tifier,
Q(k)x, which m a y b e r e a d ,
"for k . 100 p e r c e n t of x " ( s i m i l a r l y to the r e a d i n g of
"Vx" a s "for all x " and "]Ix" as " t h e r e e x i s t s an x").
The d e g r e e of s a t i s f a c t i o n of a s e t ,
R C U, with r e s p e c t to a f e a t u r e P(A), when R does not s a t i s f y P(A), i s defined as -1 n n p l u s the l a r g e s t value of k in all r e p l a c e m e n t s of a s i n g l e u n i v e r s a l q u a n t i f i e r by ~(k) in P(A) s u c h that R
s a t i s f i e s P(A) a s a c o n s e q u e n c e of t h a t r e p l a c e m e n t . When R n n s a t i s f i e s P(A), the d e g r e e of s a t i s f a c t i o n is the l a r g e s t value of k in all r e p l a c e m e n t s of a single e x i s t e n t i a l q u a n t i f i e r by ~(k) s u c h t h a t R space,
s t i l l s a t i s f i e s P(A). A topology for the n U, is developed so t h a t U c a n be m a p p e d into a s p a c e , S, with f e w e r points, in
s u c h f a s h i o n that the r e s u l t i n g l o s s of r e l e v a n t i n f o r m a t i o n i s bounded.
T h a t is, e a c h
R C U h a s a " d e g r a d e d i m a g e " , R c S, s u c h t h a t if R s a t i s f i e s P(A), t h e n t h e d e g r e e of n n n s a t i s f a c t i o n of R with r e s p e c t to P(A) d i f f e r s f r o m t h a t of R by a bounded (and r e l a n n t i v e l y s m a l l ) amount. If P(A) is an ideal f e a t u r e and all R. c K s a t i s f y P(A) with a d e g r e e 1 of s a t i s f a c t i o n g r e a t e r t h a n z e r o and all R. c C fail to s a t i s f y P(A) (i. e . , have d e g r e e of J
s a t i s f a c t i o n with r e s p e c t to P(A) of l e s s t h a n z e r o ) , t h e n U m a y be m a p p e d into a s p a c e S w h o s e s i z e ( n u m b e r of e l e m e n t s ) i s a function of the d i f f e r e n c e of s u c h d e g r e e s of s a t i s faction.
No loss of r e c o g n i t i o n ability r e s u l t s while t h e c o n s e q u e n t e c o n o m y in c o m p u t a -
t i o n is evident. A l s o , a h i e r a r c h i c a l t h e o r y of l e v e l s is u t i l i z e d so t h a t the p r o b l e m of g e n e r a t i n g a n ideal f e a t u r e c a n be s o l v e d by s t a g e s , w h e r e i n at e a c h e x c e p t the final level, f e a t u r e s w h i c h r e d u c e t h e magnitude of the p r o b l e m a r e g e n e r a t e d .
H e r e the " p o i n t s " at e a c h s u c -
c e s s i v e l e v e l r e p r e s e n t the s e t s w h i c h s a t i s f y the f e a t u r e s at the p r e v i o u s level and t h e " a t o m i c p r e d i c a t e s " at e a c h s u c c e s s i v e l e v e l d e r i v e f r o m the f e a t u r e s at the p r e v i o u s
74 level.
The method a u t o m a t i c a l l y advances one l e v e l w h e n e v e r the n u m b e r of e l e m e n t s in the
regions to be partitioned (or the n u m b e r of such regions) is t h e r e b y reduced. at each l e v e l is iden~cal.
The p r o c e d u r e
A different " r e p r e s e n t a t i o n of the p r o b l e m " is thereby e x p r e s s e d
at each s u c c e s s i v e l e v e l (Nilssen, 1971; A m a r e l , 1962; Sherma~ and E r n s t , 1969). The m a t e r i a l in this paper is o r g a n i z e d as follows. d e s c r i b e d in the f i r s t portion.
The syntactic methods a r e
F e a t u r e s a r e defined as f o r m u l a s in the weak second o r d e r
p r e d i c a t e calculus with one f r e e set variable.
The atomic predicates used specify the p o s i -
tions of, d a r k n e s s of, and other m e a s u r e m e n t s at, and relations between, each of a set of data points called the data space. These atomic p r e d i c a t e s a r e called data independent if they do not v a r y for different inputs (e. g . , the r e l a t i v e positions of the data points at which a photograph is sampled by a flying spot scanner a r e data independent, i . e . , data independent predicates do not depend upon darkness, color, e t c . ) .
Atomic predicates a r e called data dependent if and only if they
v a r y for different inputs (e. g . , the d a r k n e s s of a given d a t a point on a p a r t i c u l a r photograph). Set m e m b e r s h i p is, of course, also a p r i m i t i v e of the s y s t e m .
Objects a r e regions (subsets)
of the data space which satisfy a feature and which a r e m a x i m a l (i. e . , they have no p r o p e r s u p e r s e t s which also satisfy the f e a t u r e - - t h i s is called strongly satisfying the feature).
A
d e s c r i p t i v e basis consists of all f e a t u r e s g e n e r a t e d by the learning algorithm at a p a r t i c u l a r stage in the operation of the s y s t e m .
A description consists of the d e s c r i p t i v e basis and a
list of the e l e m e n t s in e a c h of the objects, All f o r m u l a e a r e put in distributive f o r m .
In such f o r m u l a e the scope of each quan-
t i f i e r is as s m a l l as possible, negations o c c u r only b e f o r e atomic f o r m u l a e , all subformulae within the scope of a u n i v e r s a l quantifier a r e connected by disjunctions, and subformulae within the scope of an existential quantifier a r e connected by conjunctions.
Such a f o r m u l a
is conveniently r e p r e s e n t e d by a d i r e c t e d graph which is a rooted t r e e w h e r e i n the s u b t r e e below each node r e p r e s e n t s a subformula consisting of a quantifier (if such is present) and all subformulae within its scope. Each branch f r o m t h a t node r e p r e s e n t s a subformula within the scope of that quantifier, and unquantified atomic f o r m u l a e a r e the bottom nodes o f t h e t r e e . All f e a t u r e s have c o r r e s p o n d i n g c o m p u t e r p r o g r a m s which evaluate that f o r m u l a in a given space.
If a f o r m u l a is placed in prenex f o r m and adjacent like quantifiers exchanged
to g e n e r a t e additional prenex f o r m s , distinct distributive f o r m s may be obtained by o p e r a t ing on each such prenex form.
This set of distributive f o r m s is called the distributive set
of the f o r m u l a and each such distributive f o r m c o r r e s p o n d s to a c o m p u t e r p r o g r a m which can evaluate the f o r m u l a . A p r o c e d u r e called abstraction c o m p a r e s the distributive set of one feature with that of another to d e t e r m i n e common subformulae (i. e . , c o m m o n s u b p r o g r a m s ) .
Such sub-
75 formulae are extracted, a r e called derived predicates and are retained by the system.
In
effect, abstraction extracts identical subtrees from the graphs of distinct features. Another procedure called relation abstraction exposes the similarity of structure of pairs of t r e e s with different atomic formulae.
That is, formulae which differ only in that
they contain different subformulae which, nonetheless, have the same free variables in corresponding positions, a r e extracted and retained.
In these retained formulae, called
predicate forms, differing subformulae in the features originally compared correspond to a dummy predicate, wherein the free variables a r e shown, but the identity of the predicate is not.
Such dummy predicates will later be replaced by a derived predicate with the same
free variables. Derived predicates and predicate forms are compared to produce two hierarchies of formulae, the predicate hierarchy and the relational hierarchy, later used in the "learning algorithm". P a r t 12 discusses relations between the syntax of the formulae and certain p r o p e r ties of those regions (i. e . , subsets) of the data space which satisfy the formulae.
Such
regions are called models of the formula they satisfy and a r e compared both with those given regions we desire to be models of the formula, K = R1,R 2 .
. . . .
RN, and those given regions
we desire not to be models of the formula, ~ = RN+ 1. . . . . RN+M. Measures of the " s i m i larity" bet~veen the actual models of a formula and the given regions determine various m e a sures of success of the features generated,
The ease of satisfaction of a formula is defined
as the probability that a raadomty selected element from the product space over which its free variables range satisfies the formula.
The overlap of a pair of formulae is the ease of
satisfaction of the conjunction of two formulae.
Mutations map from one feature to another.
Relaxing mutations take a formula into another which is implied by it (ease of satisfaction is increased), r e s t r i c t i n g mutations do the r e v e r s e and neutral mutations connect formulae which are not related by implication. Restricting and relaxing mutations (with the exception of quantifier exchanges) correspond to the addition or elimination of subtrees from some node on the graph of the formula, whereas neutral mutations correspond to replacements of subtrees of the graph,
All are related to the abstraction procedure.
Each feature, P., is broken into a con]unction of two formulae, P! and pD wherein 1
1
P! contains only data independent atomic predicates.
1
I
We now examine the models of Pi in
1
two sets of spaces, one consisting of each of the given regions in K and ~ (some of which we wish to be models of P. and some which we do not) and the other consisting of each model of 1 pD (in the data space). Because models of a feature must strongly satisfy it, we do not, in 1
this case, have the law of the excluded middle (L e.
'
a region which is not a model of P.
1
need not be a model of "~P~), and we are able to derive results relating the ease of satisfac-
?6 tion of a given f e a t u r e with that of m~ ideal f e a t u r e which we a r e a t t e m p t i n g to g e n e r a t e (i. e . , one of which e a c h e l e m e n t of K i s a m o d e l and none in ~ is).
That i s , by e x a m i n i n g the
s i z e and n u m b e r of m o d e l s of a f e a t u r e in the above s p a c e s we a r e able to d e t e r m i n e what kind of mutation i s r e q u i r e d . One r e s u l t of the above i s : if a given r e g i o n R. is an e l e m e n t of K (those we w i s h to 1
be m o d e l s of P.), then (a) when R. d o e s not s a t i s f y P. a r e l a x i n g m u t a t i o n on P. is r e 1
I
1
1
quired, and (b) when
R. satisfies P. but not strongly, a restricting mutation is required. I I When R. is an element of ~ (those regions which must not be models of P.) and R. strongly 1 1 1 satisfies P., any mutation may suffice (although a restricting mutation is usually preferred). 1 These criteria are, of course, averaged for all elements of K and ~. Now
a more
powerful technique of mutation selection is exposed:
Suppose
R. c K and I
R. does not satisfy P.. In P. each of the nested universal quantifiers ("¥x") is replaced i 1 1 one at a t2me, starting with the outermost (highest on the tree) by the modified quantifier "Q(k)x" which computes
the fraction of substitutions of x (as constrained by any set member-
ship atomic predicates,
"c(x, A)" within the scope of that quantifier) for which the entire
formula holds true (such fractions may fier, "Yx",
is weakened
to mean
equal zero).
That is, the original universal quanti-
"for k. i00 percent of x" instead of "for all x".
This is
done independently for each universal quantifier, and such a fractional value is thereby computed for each nested subformula
within the scope of each universal quantifier (i. e., subtree
on the graph).
Clearly this value indicates the amount
the subformula
must be increased if the given set is to be a model of the resulting (modified)
feature.
The "degree of undersatisfaetion"
as the largest of the above computed completed,
by which the "ease of satisfaction" of
of a feature with respect to a given set is defined
fractional values minus one.
After this procedure
is
each of the existential quantifiers ("'~x") are, one at a time, replaced by "Q(k)x"
and again a fractional value is computed existential quantifier.
Now
for each nested subformula
within the scope of an
each (except the bottom) node on the tree representing
a formula
has such a fractional value associated with it. Now
suppose
procedures
R. ~K and satisfies P. but not strongly. Only the latter of the above 1 I is utilized: each existential quantifier is replaced by "Q(k)x" and a set of cor-
responding
values is determined.
"degree of oversatisfaction"
The smallest of these fractional values is defined as the
of the feature with respect to the given set.
It is then shown that modified calculations of the above fractional values can be used to estimate the ease of satisfaction of the various subformulae is evaluated.
Thus,
of a feature when that feature
since derived predicates are extracted from features, their ease of
satisfaction is automatically estimated and stored,
These
derived predicates are the sub-
trees which are added and eliminated from the graph of a feature when mutation formed.
Note that the replacement
is
per-
of universal quantifiers by a "Q(k)x" quantifier is equi-
77 valent to a relaxing mutation of the f o r m u l a consisting of the u n i v e r s a l quantifier and the subformulae within its scope.
Such an a l t e r a t i o n of the quantifier is then r e p a i r e d by p e r -
f o r m i n g an actual relaxing mutation on the subformula and r e s t o r i n g the u n i v e r s a l quantifier. This mutation usually involves the addition or elimination of a subformula (i. e . , d e r i v e d predicate) whose choice is d e t e r m i n e d by its e a s e of satisfaction, which should be as c o n s i s tent as possible with the fractional value of the modified quantifier.
Neutral mutations can
be s i m i l a r l y (but m o r e weakly) d e t e r m i n e d by the e s t i m a t e d " o v e r l a p " (defined previously) of the r e q u i r e d mutations. The above p r o c e d u r e s v,~ill not always uniquely s e l e c t a mutation.
When a feature is
g e n e r a t e d its m e a s u r e s of s u c c e s s a r e evaluated and a c o r r e s p o n d i n g number called a r e i n f o r c e m e n t , which is assigned to that feature together with all d e r i v e d p r e d i c a t e s and p r e d i cate f o r m s contained within it, is a p p r o p r i a t e l y altered.
Thus all f o r m u l a e and predicate
f o r m s have such corresponding indications of t h e i r " s u c c e s s " thus far.
When s e v e r a l m u t a -
tions of a feature a r e equally appropriate, a selection is made as follows: The feature is c o m p a r e d with each f o r m u l a in the list of predicate f o r m s .
That predicate f o r m with the
highest r e i n f o r c e m e n t which will r e s u l t f r o m a mutation of the r e q u i r e d type and amount (of change) is chosen. The dummy predicates are e i t h e r r e p l a c e d by subformulae of the f e a t u r e s being mutated, o r if not t h e r e i n present, such r e p l a c e m e n t s a r e chosen f r o m the list of d e r i v e d p r e d i c a t e s (with the r e q u i r e d numbers of f r e e point and set variables). predicates with the highest r e i n f o r c e m e n t s a r e chosen f i r s t .
The d e r i v e d
Hence the e n o r m o u s p o s s i b i l i -
t i e s of mutation choice a r e reduced first, by the s e m a n t i c c r i t e r i a r e s u l t i n g f r o m e x a m i n a tion of the models of the feature being a l t e r e d , and second, by the syntactic c r i t e r i a which f a v o r those predicate f o r m s and d e r i v e d p r e d i c a t e s which c h a r a c t e r i z e previously s u c c e s s f u l features. The next part of the paper deals with the technique for reducing the size of the p r o b lem by means of the use of a h i e r a r c h i c a l level theory (discussed e a r l i e r ) for r e p r e s e n t i n g the given data by the f o r m u l a e in the d e s c r i p t i v e basis.
That is, a technique is given for
automatically r e p r e s e n t i n g objects as collections of subobjects which a r e collections of s u b subobjects, e t c . , all such objects being defined by f e a t u r e s which a r e s i m i l a r l y h i e r a r c h ically organized. The following part of the paper t r e a t s the topology of the data space as r e l a t e d to techniques for computation reduction.
The m o s t i m p o r t a n t notion is a set of reduction m a p -
pings which s u c c e s s i v e l y r e d u c e the s i z e of the data space (e. g . , the fineness of g r a i n of sampling).
T h e s e mappings a r e r e l a t e d to i n v a r i a n c e s with r e s p e c t to t r a n s f o r m a t i o n s which
dilate o r contract the space.
The way in which r e s u l t i n g e r r o r s depend upon such a reduction
mapping t o g e t h e r with a p a r t i c u l a r feature a r e studied.
78 The final part d e s c r i b e s the o v e r a l l s y s t e m a t i c p r o c e d u r e for solving the problem. Various important open questions, whose solution would vastly affect the power of the s y s t e m a r e discussed.
F o r an i l l u s t r a t i v e example which s i m u l a t e s the procedures d e s c r i b e d ,
see Rothenberg (t973b). It is important to note thgtthe techniques developed p e r m i t a human t r a i n e r to simply and d i r e c t l y i n s e r t any knowledge o r intuitions he has about the p r o b l e m at any t i m e during o r p r i o r to computation.
Hence the task of problem solution begins at the limits of the
trainerTs knowledge and is l e s s difficult than would o t h e r w i s e be expected. The description below is g e a r e d for pictorial pattern interpretation.
It is e a s i l y seen,
however, that other pattern i n t e r p r e t a t i o n problems fit the s a m e f o r m a l i s m 2.
Syntax The s e n s o r y data or input consists of a digitized sampling of a (single) picture.
This
sampling is at a finite o r d e r e d a r r a y of points called the data space, u = { x l , x 2 . . . . . Xn} , which is the s a m e for all pictures.
F o r each such data point (which c o r r e s ponds to a r e c e p -
tor in the s e n s o r y field such as a photosensitive cell), t h e r e is a v e c t o r of k values called its value vector, each element of which is called a data value.
F o r i l l u s t r a t i v e p u r p o s e s we
will h e r e a s s u m e that the f i r s t two positions in the vector specify the row and column p o s i tions, r e s p e c t i v e l y , (in the o r d e r e d array) of the data points.
The r e m a i n d e r of the data
values specify different quantized qualities (i. e . , color or darkness) of that data point on a p a r t i c u l a r picture (these c o r r e s p o n d to a quantized e n e r g y density at a p a r t i c u l a r receptor). The a r r a y of all value v e c t o r s (at all data points) is called the value m a t r i x and is denoted IIv(k)ll where k indexes the positions in the value vector (the p a r t i c u l a r fineness of g r a i n of sampling is specified by the s i z e of the matrix).
F o r convenience, each lower c a s e l e t t e r ,
J~xWr, ,yWt etc. will be used to designate a data point (i. e. the f i r s t two positions of the value vector), the kth data value of point x will be denoted "v(k)(x) ~,, and upper c a s e l e t t e r s ,
"A",
'~Bt~, etc. will denote sets of data points. Data values d e t e r m i n e the truth values of a set of p r i m i t i v e s (also called atomic predicates1),
c~(k' i)(x), which a r e " t r u e " if v(k)(x) -- i and ~fatse ~ otherwise.
Those for
which k > 2 a r e called data dependent p r i m i t i v e s because they differ for different input photographs. Also given are a set of n place p r i m i t i v e s , ~(Xl,X 2 . . . . . x n) which specify ( g e o m e t r i c a d r e l a t i o n s between data points. t
A typical example would be " < ( x , y , z , w ) " which h e r e
Conventionally, the t e r m ~Iprimitive" r e f e r s to a specified '~property" or r e l a t i o n (e. g . , ~E~ for ~'set m e m b e r s h i p " ) , w h e r e a s "atomic p r e d i c a t e " r e f e r s to the p r i m i t i v e together with a specific s e t of arguments (e. g. ~ "~(x, A)"). The usage of t h e s e t e r m s h e r e ignores the distinction,
79 means that data point x is c l o s e r to y than z is to w.
This is usually d e r i v e d f r o m a given
m e t r i c on the data space (which is a function of v(1)(x) and v(2)(x) -- the row and column positions of point x).
Such atomic p r e d i c a t e s (as well as ~(l"i}(x)" and a(2'i)(x) ) a r e called
data independent because they a r e the s a m e for all input photographs. The following definitions c l a r i f y the syntax used. (1) Region:
Any subset of a data space.
(2) F e a t u r e : A formula, P(A), in the second o r d e r predicate calculus with equality such that: (a)
point v a r i a b l e s (x, y . . . . ) range o v e r data points, set v a r i a b l e s
(A, B . . . . )
range o v e r r e g i o n s , and all constants (c 1, c 2 . . . . ) are data points, or sets of data points (C 1, C 2 . . . . ). (b)
all v a r i a b l e s a r e bound except one set variable, A (hence only regions can satisfy a feature).
(c) p r i m i t i v e s include "e (x,A)" (conventionally " x e A " ) and "= (x,y}" (conventionally "x = y") 1, both of which a r e called e l e m e n t a r y p r i m i t i v e s . "card(A) < card(B)" may also be used. (Also included a r e the data independent and dapendent p r i m i t i v e s (atomic predicates) defined
above. ) Certain other conditions may be included which guard against formulae with t r i v i a l interpretations in the pictorial c a s e .
T h e s e will not be d i s c u s s e d here ( s e e Rothenberg,
1973b). (3) Object: A region which s a t i s f i e s a feature (i. e . , is defined as a r e a l i z a t i o n of that feature} and is not a proper subset of any other r e a l i z a t i o n of that s a m e feature (i. e . , it is "maximal}.
Note that while a r e g i o n may be an object because
strongly s a t i s f i e s one f e a t u r e , it may satisfy another f e a t u r e , but not strongly. When an object s a t i s f i e s a feature and is m a x i m a l with r e s p e c t to that p a r t i c u l a r feature it will be said to strongly satisfy that feature and is called a model of the feature (as distinct f r o m a realization}.
When a set of points satisfies a feature
but is not maximal for that feature, it will be said to satisfy that feature, but not strongly. (4) D e s c r i p t i v e Basis:
All f e a t u r e s which have been generated by the learning
algorith m (which g e n e r a t e s s u c h features) at a p a r t i c u l a r stage in the adaptive development of the analysis. 1
Note that although " = (x, y)" will be used as an atomic predicate, it can, in the c a s e of our illustrations, be defined as follows:
y) =- Vz (~,< i x , z , y, z )A "" < (Y, z ,x,z }) (see " = (x, y, z, w)"definition in Example 1).
80 (5) Description:
This contains all features in the d e s c r i p t i v e basis and lists all
objects strongly satisfying each of these f e a t u r e s and the e l e m e n t s of each such object.
The satisfaction of a feature by an object which does not strongly satisfy
that p a r t i c u l a r feature is also indicated. (6) Object Class: A set of objects all of which strongly satisfy the s a m e feature (also defined as the extension of the f o r m u l a for that feature). (7) Derived P r e d i c a t e s : A subformula of a feature which is r e c u r s i v e l y built up f r o m p r i m i t i v e s by the use of logical connectives and quantiflers. denoted "Di~Xl' . . ,x . n, . . A .1 , .
They a r e
, A m ) " where i indexes the predicate and its
argument includes all f r e e v a r i a b l e s . (8) Data Dependent P r e d i c a t e s : All f o r m u l a e (including features) which contain data dependent p r i m i t i v e s .
All other f o r m u l a e a r e called data independent.
Example 1 Let the primitives that the distance between and w.
be "~ (X, A)",
"= (x, y)",
and "< (x, y, z,w)",
which specifies
data point x and data point y is less than the distance between
Also let "D(x)" indicate that a data value (the third position in the value vector at
data point x) is equal to I. the former predicates
Here we assume
that these data values are either one or zero,
indicating a "dark" and the latter a "light" point. 1 are:
= (x,y,z,w) -N<(x,y,z,w)A
~" < ( z , w , x , y )
Ob~,y,~)- ~ =[x,y]^~--[x,~]^
Then
examples
of derived
("ix, y) equals (z,w)") 2
~ =[y,~]^ Vw(= [y~w] v <[x,y,x,w] v <[~,y,z,w]) (y is "between"
D ( A , B ) ~ V x ( e [ x A]'--> ~ [ x , B ] ) c
("A is contained in B")
D (A,B) ~ D ( A , B ) A D (B,A) s e c
("A is the s a m e as B")
o~)
("A is the null set")
-= ~ 3x (~ Ix, A])
x and z)
Dd~) = Vx (~ Ix, A]-->5 Ix])
("all points in A are 'dark' points"~
Dae, y) = ~ =Ix,Y] Aw (~Db[X, z,y])
("x is adjacent to y,,)3
1
z
Note that throughout this description square brackets " [ ] " and round b r a c k e t s " 0 " are used interchangeably and a r e alternated for c l a r i t y only. 2 Note that " = " when h e r e used as a four place predicate, " = (x, y, z , w) ", has a different meaning than when used as a two place p r i m i t i v e , " = (x,y)" (meaning that x and y a r e the s a m e point). 3 F o r use with a c o a r s e (sampling) grid it is suggested that Da(X, y) = ~'~ = (x, y) A Vz (= Ix, z] V ~
81
Note that all y which satisfy Db(X,y,z) when x and z are fixed will approximate a "straight line" even if the grain of the data space is c o a r s e .
As the g r a i n becomes infinitely
fine these points approximate a "true" straight line. F o r convenience 1 we will use the symbol "~/:(xt,x2,. .. ' x n )" to denote that all variables within brackets denote distinct objects: ~b(x,y,z) = ~-- = ( x , y ) A ~ = (x,z)A "~ = (y,z) . Hence Db ('~etweenness") in Example t may be r e w r i t t e n
D
y, z) :
y, z)^ vw(= [y, wl v < Cx, y,x, w]
w])
Note that a large n u m b e r of formulae are tautologous u n l e s s their free v a r i a b l e s a r e distinct. 3.
Semantics (Illustrations) The t r a n s l a t i o n from formulae to p r o g r a m s is simple.
Quantifiers become "do
loops" whose ranges are determined by the m e m b e r s h i p predicates, e.g. VX 1 [,~e{Xl,A)VP(Xl . . . . .
Xn}] = X lA( A P(Xl ' " .. ,Xn)
3x I [p(xI.....Xn)-] _- X l ~VU P(Xl'. . . . x n) 3Xl[e{xl, A) AP(x 1. . . . . Xn)"] K
V P(Xl, ,Xn) XleA '..
( ' U " is the u n i v e r s a l set - - i. e . , the data space) 2 Logical connectives are functions computed by subroutines, and atomic and derived p r e d i cates become subroutines in the main program e x p r e s s i n g the feature. Some exaznples of the r i c h n e s s of the s y s t e m when the primitives of Example 1
are used are: P I(A) =- VxVyVz (e[x, A~ h e [z,A~ A Db[X, y, z]-'> e~¢, A~) is data independent and satisfied by convex sets only (Db[X,y,z ] is defined as in Example 1). tf PI(A) is a feature, then, by definition, only maximal regions are objects. Let Dd(A)~- Vx (e [x, A~--> [) [x] )
(asbefore) .
Then P2(A) :- Dd(A) A PI(A) is a data dependent v e r s i o n of PI(A) 1 Although not described here, the language has been generalized to include "syntactic v a r i a b l e s " which range over formulae and p r i m i t i v e s which specify whether these v a r i a b l e s a r e bound o r free. P r o g r a m m i n g is thereby facilitated when the language is used as a c o m p i l e r (see P e s s i n and Rothenberg reference). 2 Quantified set variables range over regions. Methods of reducing sueh computation a r e d i s c u s s e d in Rothenberg (1973b)
82
defines a "starlike" region, point, x, of a region,
A,
and a derived predicate which is satisfied only by a boundary is given by
A feature satisfied only by a connected I region can be constructed
in two steps:
is a d e r i v e d predicate which a s s e r t s that A is " c l o s e d " in B under the r e l a t i o n of adjacency and P6(A) = V B ~ c [B,A] A"~D~ [B]A D2 [B,A~---> Ds [B,A~ ) is satisfied iff A is a connected region ("for all B, if B c A B = A " - - s e e Example 1).
and B ~ ~ and D 2 [B,A] then
Other equivalent f o r m u l a e exist.
Simple connectedness ('A has no holes") is e a s i l y e x p r e s s e d by stating that the boundaries of both A and its complement are connected sets.
Other illustrations are easily
constructed. An example of a data dependent feature is P7(A) which a c c o m m o d a t e s "noisy" dark areas:
4.
Distributive Normal F o r m s This is a f o r m in which all quantifiers a r e distributed as much as possible along
the t e r m s of a f o r m u l a so that a minimum number of t e r m s lie within the scope of each quantifier.
(It is the opposite of a prenex n o r m a l f o r m and is s i m i l a r to, but not identical to,
the " m i n i - s c o p e " of Wang (1960) and somewhat r e s e m b l e s the "distributive normal f o r m s " of Hintikka (1953).
This is accomplished on a f o r m u l a by r e v e r s i n g the techniques for
placing f o r m u l a e in prenex normal f o r m (Rothenberg, 1971).
A formula is in distributive
n o r m a l (henceforth abbreviated "distributive") f o r m iff: (1) Negations appear only before atomic subformulae. (2) All subformulae 2 within the scope of a u n i v e r s a l quantifier are connected by disjunctions. t
By "connected r e g i o n " is intuitively meant that for e a c h pair of s t ~ - r e g i o n s which partition the r e g i o n t h e r e exists a pair of adjacent points, one of which is contained in each subregion. 2 A subformula is either an atomic predicate or d e r i v e d predicate or either of these quantified a n d / o r negated.
83
(3) All s u b f o r m u l a e within the s c o p e of a n e x i s t e n t i a l q u a n t i f i e r a r e c o n n e c t e d by conjunctions. (4) All s u b f o r m u l a e within the s c o p e of a q u a n t i f i e r a r e e i t h e r p r e f i x e d by a q u a n t i tier or are atomic formulae or their negations.
(That is, they a r e not b r a c k e t -
e n c l o s e d conjunctions o r d i s j u n c t i o n s of o t h e r s u b f o r m u l a e . ) (5) All s u b f o r m u l a e within the s c o p e of a q u a n t i f i e r c o n t a i n t h e quantified v a r i a b l e as an argument. (6) If two o r m o r e like q u a n t i f i e r s a r e a d j a c e n t (e. g . ,
"VxVy" o r " ~ x ~ y ' ) , all
s u b f o r m u l a e within t h e i r scope m u s t c o n t a i n s u c h a d j a c e n t l y quantified v a r i a b l e s as arguments. E x a m p l e 2. Consider the formula
It h a s only one d i s t r i b u t i v e f o r m (in g e n e r a l , t h i s is not t h e c a s e - - t o be d i s c u s s e d } :
F o r c o n v e n i e n c e we h e r e i n s i s t t h a t , within the s c o p e of e a c h q u a n t i f i e r , Ca} s e t m e m b e r ship p r i m i t i v e s p r e c e d e all o t h e r s , (b) quantified t e r m s be p l a c e d l a s t , and (c) t h o s e t e r m s w h o s e a r g u m e n t s contain f e w e r v a r i a b l e s p r e c e d e t e r m s w h o s e a r g u m e n t s c o n t a i n a g r e a t e r n u m b e r of v a r i a b l e s . Note t h a t , b e c a u s e of (1) - (6) above, a d i s t r i b u t i v e f o r m u l a m a y be e a s i l y r e p r e s e n t e d by d i r e c t e d g r a p h w h i c h is a r o o t e d t r e e w h e r e i n t h e s u b t r e e below e a c h node r e p r e s e n t s a s u b f o r m u l a c o n s i s t i n g of a q u a n t i f i e r (if s u c h is present} and all s u b f o r m u l a e within 1 i t s scope. E a c h b r a n c h f r o m t h a t node r e p r e s e n t s a s u b f o r m u l a within the s c o p e of t h a t q u a n t i f i e r , and unquantified a t o m i c f o r m u l a e (and t h e i r negations} a r e the nodes with no successors.
The n u m b e r of d i s t i n c t bound v a r i a b l e s in the f o r m u l a c o r t e s ponds to the n u m -
b e r of e d g e s i n t h e l o n g e s t path down the t r e e .
C i r c u l a r n o d e s will be u s e d to c o n t a i n q u a n -
t i f i e r s of point v a r i a b l e s , two c o n c e n t r i c c i r c l e s will contain q u a n t i f i e r s of s e t v a r i a b l e s , and r e c t a n g u l a r nodes will c o n t a i n a t o m i c p r e d i c a t e s .
T h e point v a r i a b l e s will be indexed
in t h e i r o r d e r of q u a n t i f i c a t i o n ( s t a r t i n g at the top of the tree} by i n t e g e r s . will be s i m i l a r l y indexed by R o m a n n u m e r a l s . 1
Set v a r i a b l e s
F r e e point v a r i a b l e s will be denoted by
When the e n t i r e f o r m u l a i s not quantified but i s i n s t e a d a logical c o m b i n a t i o n of f o r m u l a e which a r e quantified, the top nodes of the g r a p h c o r r e s p o n d to c o n n e c t i v e s " ^ " o r " V " i n s t e a d of q u a n t i f i e r s . T h e g r a p h r e p r e s e n t a t i o n is h e r e u s e d only for i l l u s t r a t i v e p u r p o s e s .
84
01' 02 . . . .
etc. in t h e o r d e r in which they a p p e a r in a t o m i c p r e d i c a t e s .
will be s i m i l a r l y denoted ~1' ~2 . . . .
etc.
Free set variables
When a f e a t u r e is r e p r e s e n t e d , t h e r e will be only
one f r e e v a r i a b l e , the s e t v a r i a b l e , ~. H e r e an example of a f i r s t o r d e r f e a t u r e is shown (for a g r a p h of a s e c o n d o r d e r f e a t u r e s e e E x a m p l e 5): Example 3 C o n s i d e r t h e f e a t u r e P10(A), w h i c h is s a t i s f i e d by r e g i o n s w h i c h a r e " s t r a i g h t l i n e s " c o n t a i n i n g m o r e than two points: A d i s t r i b u t i v e n o r m a l f o r m of t h i s f o r m u l a is
A g r a p h c o r r e s p o n d i n g to t h i s f o r m u l a is
T h u s , to decode the above g r a p h , we m a y b e g i n at t h e bottom q u a n t i f i e r : Let A = ~, x = x 1, y = x 2, z = x 3, w = x 4 and we obtain the following s u b f o r m u l a which we will denote "Dl(x,y,z,A)"(where
x,y,z
and A a r e the f r e e v a r i a b l e s ) :
v w ( : ~, w] v < <x, %x, w ~ , < ~, ~, y, w]) _ , l ~ , y, %,) If we include t h e note above i t we obtain Vz ( - ~ , c ~ , A ? VD 1 ~ , y , z , A ~ )
_ D2(x,y,A).
Now if we w r i t e the f o r m u l a c o r r e s p o n d i n g to the node to the left of the one j u s t considered:
Moving up a node on t h e g r a p h we obtain:
~y(e~z,A] ~ D2[X, y , A ]
AD3[x,y,A])
P r o c e e d i n g to the top node we o b t a i n
= D4(x,A)
.
85
3x (o
^,4
-- P10(A}
which is an alphabetic variant of the f o r m u l a for P10(A) given at the beginning of the e x a m pie. Note that this graph r e p r e s e n t a t i o n e n s u r e s that the m i n i m u m n u m b e r of variables is used (Rothenberg, 1973b). In general, prenex n o r m a l formulae have m o r e than one d i s tributive form; also, a given distributive formula will often have m o r e than one p r e n e x form (e. g., when two branches from the same node contain differing quantifiers and all branches from that node contain quantifiers, e . g . ,
Vx (Vy[p(x,Y)3~/3y[q(x,y)]) c a n b e put
into the prenex n o r m a l forms YxVy3z(p[x, y ] v q [ x , z3) and Vx3zVy(p~x, y~Vq[x, z~). ) Note that the prenex form has m o r e quantified variables than the distributive form. This is often the case. We are here interested in the distributive set of a formula.
This is defined as the
set of formulae obtained by placing a distributive f o r m u l a in prenex form, obtaining all p r e nex forms resulting from the exchange of adjacent like quantifiers, placing each of such prenex forms in distributive form and eliminating the identical formulae which r e s u l t (more economical methods exist}. Another form of i n t e r e s t here is called the nested form.
This corresponds to a
prenex formula wherein the quantifiers are imported 1 into the subformulae within this scope until a further such importation would r e s u l t in a c i r c u l a r node on the graph having two c i r cular nodes as immediate sueees s o t s .
Such a f o r m u l a is obtained from a distributive f o r -
mula,whenever two or more quantified subformulae (i. e. s u b t r e e s on the graph) a r e the immediate s u c c e s s ors of a quantifier (circular node on graph), by consolidating such s u b formulae within the scope of a single quantifier. A nested form of the formula in Example 3 is (also see Example 5): P10(A) = ~ x ~ e ( x , A ) A 3 z ~ [ z , A ~
AVy E~e(y,A)
~/(~b ~ , y , z 3 AVw C: (y,w) v < ( x , y , x , w ) v < (z, y, z, w)])J ) J . Note that both conjunctions and disjunctions now appear within the scope of the quantifier of the variable, y.
Nested formulae may be graphed by including nodes containing
disjunctions and conjunctions. The graph of the nested form of P10(A) above is
1
That is, prefixed to a s u b f o r m u l a r a t h e r than the e n t i r e formula initially within its scope.
86
) 0
Although formulae, if in distributive normal form, translate into efficient computer programs (nested form is more efficient when it contains no more variables than the distributive form), the principal motivation here is the necessity for such form in the procedures which follow. Also, the "learning" algorithm generates and operates upon formulae in their distributive form. 5. Compression and Decompression of Formulae In order to compare different formulae which contain identical derived predicates as subformulae, it is necessary to guarantee that such will not be concealed by their form. Hence, we define the following procedures: Compression: This operation consists of replacing an innermost phrase of a formula by an abbreviation, Di(X1. . ,Xn, A 1. .. Am), with the number of arguments equal to the number of free variables (see Example 3 ~ o v e ) .
If this predicate is a derived predi-
cate which has already been generated (to be discussed), substitute its abbreviation. This is called one layer of compression. This may be repeated until all phrases are exhausted. When
formulae for {all) existing derived predicates are replaced by their abbreviations,
the resulting formula is defined as in collapsed form.
Example 4
PI(A) -: Yx (,re ~ , A] V~y ~(y,A) VDl(X,y, A)])
_
(~e
)
Decompression: This is the revers e of compression where each derived predicate has its definition substituted for its abbrevation in the formula being decompressed. is done one derived predicate at a time, working from the innermost outward.
This
Each such
87 substitution is defined as one l a y e r of d e c o m p r e s s i o n .
This may be r e p e a t e d until only
p r i m i t i v e s remain, in which c a s e the resulting f o r m u l a is called the complete formula.
In
Example 3 above, we would substitute -~(x,y,z)V~w(~[y,w~A~<~x,y,x,w~A'x,<~y,z,w,z~) 6.
for ~'Db(X, y, z) .
Simple Abstraction This is a p r o c e d u r e whereby the collapsed (distributive) f o r m s in the distributive
s e t s of P. and P. (or the graph of these forms) a r e mechanically c o m p a r e d and c o m m o n 1 l subformulac of m a x i m u m length (i. e . , with m a x i m u m n u m b e r of contiguous symbols) a r e e x t r a c t e d and f o r m d e r i v e d p r e d i c a t e s ,
Each c o m p a r i s o n proceeds f r o m t e r m s of the i n n e r 1 most phrase outward to the remaining phrases. Whichever of P. o r P. has f e w e r distinct t i collapsed f o r m s is chosen, say P.. E a c h such f o r m is c o m p a r e d with any collapsed f o r m of t P. and ,~P.. The longest subformulae which a r e c o m m o n to both formulae a r e e x t r a c t e d 1 1 and labeled as d e r i v e d predicates. P e r m u t a t i o n of t e r m s within a phrase in o r d e r to e x t r a c t a longer formula is permitted.
Also p e r m i t t e d a r e exchanges of v a r i a b l e s in p r i m i t i v e s
w h e r e the extension r e m a i n s unchanged t h e r e b y ( e . g , ,
<(x,y,z,w) - < (y,x,z,w)).
Sub-
stitutions of equivalent p r i m i t i v e s may also be used, e . g . , ~, < (x, y, x, z) = < (x, z, x, y)V = (x, y, x, z). When c o m p a r i s o n is made, if a distributive (collapsed) f o r m deviates f r o m nested (collapsed) f o r m because a quantifier has been distributed through b r a c k e t s , an additional c o m p a r i s o n is made after nested f o r m has been r e s t o r e d (see Example 5 below). Notice that the use of collapsed f o r m s guards agains e x c e s s i v e computation by not manipulating f o r m u l a e for existing d e r i v e d predicates (which r e s u l t e d from simple a b s t r a c tion previously performed). Example 5 H e r e we c o m p a r e (the distributed f o r m of) a formula, Pg(A), which is strongly s a t i s fied by the union of all boundary points of dark c i r c u l a r regions (i. e . , those regions which
satis~ derived predicate D II{A) --3x:3y3z(~ Ix,y~ A [~ {z,A) <--->< (x,z,x,y}]) with feature, PI0{A}, of Example 4 (forconvenience ~b{x,y,z) and ~(x,y,z) willnot be decompressed):
,,,,y 1
V<[x,y,x,w-j v <
y, z,w])])].
That is, those strings of symbols (starting f r o m the right of the distributive formulae) which a r e c o m m o n to both formulae and which contain no proper substrings common to both a r e extracted.
88 Although P10(A) is in distributed form, it does not conform to nested form
Hence we con-
solidate all terms quantified by "Vy" within the scope of a single such quantifier:
pl0~l- 3x Fc(x A~^ 3z(o Ez,a ^ vy F~~(y A/ V(~ Ix, y, z] h ~¢w [= (y, w) v < (x, ~,x, w~ v < (z, y, z,
~)])])]
P9(A) has another distributive form, but we here take the negation of the above form and l~tbel our variables so that their order in the innermost phrase is similar to the order of variables in the innermost phrase of P10(A):
V ~ y ~ Ix, z, y] A Y w [ : (y,w)V < (x,y,x,w)V < (z,y, z , w ) ] ) ] ) ] A graphical representation of 'vP9(A) is
,,E(1)I)"]
_
Comparison (from right to left) yields the common maximum subformula Db(X,Y,Z) = ~'(x,y,z) hVw [= (y,w) V<(x,y,x,w) g < ( z , y , z , w ) ] and we see that P10(A) - ~ 3 z ( c [ x , A ]
Ac ~,A-] AVy ~(y,A)
-~Db(X,y, z)])
and if we substitute Da(X, y) for ~ (x, y) AVz (~-,Db [,% z, y]) ("x adjacent to y", see Example 1), P9(A) = Vx3B(c Ix, A] -->c [x, B] A D11 [B] ADd []3] h 3y I ' v e ( y , B) A Da(X,y)]) This procedure is more easily seen by extracting common subtrees of the graphs of ,vP9(A) and P10(A) (see previous section). 1 1Although not done in the diagrams above, for mechanized execution of the abstraction procedure, variables should be indexed in reverse order of quantification (i. e. starting from the bottom of the tree).
89 Comparison of even the simplest formulae often yields derived formulae.
See
Rothenberg (1973b) for examples. In e s s e n c e , the f o r m u l a s o b t a i n e d by abstraction (and by "relation abstraction", to be discussed) are those "properties" of features we consider in this system. 7. The Predicate Hierarch~y Complete abstraction is the application of the techniques of simple abstraction to complete formulae (i. e., formulae which have been decompressed
till only primitives re-
main--see Section 5). This is performed at critical points in the flow of the system, as when computer memory
is becoming exhausted.
such
Then all derived predicates retained by
the system are eliminated and complete abstractionis performed with all pairs of features in the descriptive basis (i. e., "properties" of features are found).
The derived predicates
obtained are retained by the system (for purposes to be described in Section 15) and each
pair of these is again compared to extract maximal common subformulae which again become derived predicates (i. e., "properties of properties" of features are found). This procedure continues until only primitives remain, and the resulting set of derived predicates is called the l~redicate hierarchy.
In this manner an economical representation of the
structure of the descriptive basis may be obtained. 8. Relation Abstraction Here we compare two formulae (again in compressed form), which although they possess no common subformulae, have identical logical form (i. e . , identical relations between their subformulae), or which have subformulae of identical logical form.
Consider
P15(A) = VxVy(¢[x,A~ hOa~X,y~"->~ ~,A~) which expresses closure under the relation of adjacency, and PI6(A) ~ ~¢xVy(e~,A] A D5~x,y~--->e~y,A~) which defines a region closed under another binary relation, D5(x, y). When relation abstraction is here performed a dummy predicate K(x, y), replaces the differing binary predicates in the two formulae, and a predicate for m results:
This variable predicate expresses closure with respect to some unspecified binary relation K ~X, y]. The procedure for comparing P. and P. is as follows: 1
3
Compress whichever of P.
1
and P. has the most variables until both formulae contain the same number of variables. 1 l
1See Example 4 for illustration of how the number of variabIes is reduced by compression.
90 If the substitution of k (at first k = 1) distinct dummy predicates in each of P. and P. 1 j makes them identical, such resulting formula is a predicate form and is retained by the system.
(This compression makes use of the negation of a formula and the other devices
used in simple abstraction. ) When such a substitution does not render P and P. identical, 1 J 1 both formulae a r e compressed one layer and the comparison procedure is repeated. Subformulae of a phrase may be permuted or combined, and a dummy predicate may be inserted where no subformula is present if needed to avoid combining two subformulae (one of which is in the other formula) into a single formula.
(That is, if Pi(x, y) A Pj(y, z)
A Pk(y, z, w) is part of a phrase being compared with Pi(x, y) A Pk(y , z, w), the latter b e comes P.(x,y)A K(y, z) A Pk(y, z,w) and K(y, z) is also substituted for P.(y, z) in the f o r 1 ] mer. ) Example 6 Compare a predicate which is strongly satisfied by the boundaries of all dark convex s ets P17(A) =--.Vx ~(x,A)
> "3BE~(x, B)A P2(B) A 3 y (,-,-,((y, B) A Da(X,y))"])
with a predicate which defines the boundaries of all dark sets with property P3(A): P18(A) ~ Vx ~ ( x , A)---~ 3B ~(x, B)A Vx (~(x, B)----> D(x)) AP3(B)/~3y (,vc(y, B)A Da(X, y ) ) ~
Putting both in distributive normal form: PI7(A) - Vx (Ne(x,A)V 3B [,(x, B)A P2(B)A3y (-v~(y, B) A Da(X,y))~ )
P17(A) has fewer variables than P18(A), Hence compression of P18(A) (indicated by bracket under above formula) yields:
The next to innermost phrase above has a g r e a t e r number of subformulae than the next to innermost phrase of P17(A). Hence subformulae of P18(A) are combined (as indicated by bracket under above formula} to yield:
1
The entire procedure may be repeated for k = 1o 2 . . . . . n (n is chosen to conform with the availability of computer memory and to avoid excessive iteration. Hence it will usually be small. )
91 It is now easy to see that comparison of the compressed sets for PIT(A) and PlS(A) above will yield the following predicate form:
which defines the boundaries of all regions, B, which satisfy K(B), Again, the above procedure can be performed by comparison of the graphs of PI7(A) and P I8(A) for similarity of structure (exclusive of the different atomic formulae}. Relation abstraction is executed whenever simple abstraction is, and predicate forms are also retained by the system I (for uses to be described in Section 15). W h e n complete abstraction is performed and the predicate hierarchy is restructured, relation abstraction is also performed on complete formulae and, in similar fashion, a hierarchy of predicate 2 forms (called the relational hierarchy) is constructed, At each successive level in this hierarchy the predicate forms acquire additional d u m m y variables. None are retained with more than n such d u m m y variables, 9. An Elimination Procedure for the Set Membership Primitive For our purposes we define a feature, P(A) as a tautology iff P is satisfied by all subsets of the data space or only by the entire data space. P(A) is defined as a contradiction iff P is satisfied by no subset of the data space.
Now we eliminate vacant predicates and tautologies which derive from the use of the primitive, "e(x, A)".
Contradictions and tautologies a r e c h a r a c t e r i z e d by: YA (P ~k]