{"pk":30627,"title":"A Model of Schema Selection Using Marker Passing and Connectionist Spreading Activation","subtitle":null,"abstract":"Schema selection involves determining which pre-stored schema best matches the current input.Traditional serial approaches utilize a match/predict cycle which is heavily dependent upon backtracking.This paper presents a parallel interactive model of schema selection called SAMPAN which is more flexible and adaptive. SAMPAN is a hybrid system that combines marker passing with connectionist spreading activation to provide a highly malleable and general representation for schema selection. This work is motivated by recent success in connectionist schema representations and in natural language marker passing systems. A connectionist schema representation provides many attractive features over traditional schema representations. However, a pure connectionist representation lacks generality; new propositions cannot easily be represented. SAMPAN gets around this problem by using marker passing to perform variable binding on generalized concepts. The S A M P A N system is a constraint satisfaction network with nodes that perform simple pattern matching and input summation. This approach is directly applicable to current schema-based systems.","language":"eng","license":{"name":"","short_name":"","text":null,"url":""},"keywords":[],"section":"Artificial Intelligence and Simulation II","is_remote":true,"remote_url":"https://escholarship.org/uc/item/7qs8c349","frozenauthors":[{"first_name":"Hon","middle_name":"Wai","last_name":"Chun","name_suffix":"","institution":"Honeywell Bull","department":""},{"first_name":"Alejandro","middle_name":"","last_name":"Mimo","name_suffix":"","institution":"Gold Hill Computers","department":""}],"date_submitted":null,"date_accepted":null,"date_published":"1987-01-01T18:00:00Z","render_galley":null,"galleys":[{"label":"PDF","type":"pdf","path":"https://journalpub.escholarship.org/cognitivesciencesociety/article/30627/galley/20476/download/"}]}