Skip to main content

Script Recognition with Hierarchical Feature Maps

  • Chapter
Connectionist Natural Language Processing

Abstract

The hierarchical feature map system recognizes an input story as an instance of a particular script by classifying it at three levels: scripts, tracks and role bindings. The recognition taxonomy, i.e. the breakdown of each script into the tracks and roles, is extracted automatically and independently for each script from examples of script instantiations in an unsupervised self-organizing process. The process resembles human learning in that the differentiation of the most frequently encountered scripts become gradually the most detailed. The resulting structure is a hierarchical pyramid of feature maps. The hierarchy visualizes the taxonomy and the maps lay out the topology of each level. The number of input lines and the self-organization time are considerably reduced compared to the ordinary single-level feature mapping. The system can recognize incomplete stories and recover the missing events. The taxonomy also serves as memory organization for script-based episodic memory. The maps assign a unique memory location for each script instantiation. The most salient parts of the input data are separated and most resources are concentrated on representing them accurately.

This research was supported in part by an ITA Foundation grant and by fellowships from the Academy of Finland, the Emil Aaltonen Foundation, the Foundation for the Advancement of Technology, and the Alfred Kordelin Foundation (Finland). Special thanks go to Michael Dyer for valuable comments on an earlier draft of this paper.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Gordon H. Bower, John B. Black & Terrence J. Turner (1979) Scripts in memory for text. Cognitive Psychology, 11, 177–220.

    Article  Google Scholar 

  • R.E. Cullingford (1978) Script Application: Computer Understanding of Newspaper Stories. PhD thesis, Department of Computer Science, Yale University, 1978. Technical Report 116.

    Google Scholar 

  • G.F. Dejong (1979) Skimming Stories in Real Time: an Experiment in Integrated Understanding. PhD thesis, Department of Computer Science, Yale University. Research Report 158.

    Google Scholar 

  • Charles P. Dolan & Michael G. Dyer (1987) Symbolic schemata, role binding, and the evolution of structure in connectionist memories. In: Proceedings of the IEEE First Annual International Conference on Neural Networks. Piscataway, NJ: IEEE.

    Google Scholar 

  • Michael G. Dyer (1990) Symbolic neuroengineering for natural language processing: a multilevel research approach. In: J. Barnden & Jordan Pollack (Eds) Advances in Connectionist and Neural Computation Theory. Norwood, NJ: Ablex.

    Google Scholar 

  • Michael G. Dyer, R.E. Cullingford & Sergio Alvarado (1987) Scripts. In: S. C. Shapiro (Ed.) Encyclopedia of Artificial Intelligence. New York: John Wiley.

    Google Scholar 

  • Charles J. Fillmore (1968) The case for case. In Emmon Bach & Robert T. Harms (Eds) Universals in Linguistic Theory. New York: Holt, Rinehart & Winston.

    Google Scholar 

  • Richard M. Golden (1986) Representing causal schemata in connectionist systems. In: Proceedings of the Eighth Annual Cognitive Science Society Conference. Hillsdale, N.J.: Lawrence Erlbaum.

    Google Scholar 

  • Geoffrey E. Hinton (1981) Implementing semantic networks in parallel hardware. In: Geoffrey E. Hinton & James A. Anderson (Eds) Parallel Models for Associative Memory. Hillsdale, N.J.: Lawrence Erlbaum.

    Google Scholar 

  • Graesser, A.C., Gorden, S.E. & Sawyer, J.D. (1979) Recognition memory for typical and atypical items in scripted activities: tests for the script pointer + tag hypothesis. Journal of Verbal Learning and Verbal Behaviour, 18, 319–332.

    Article  Google Scholar 

  • John J. Hopfield (1982) Neural networks and physical systems with emergent collective computational abilities. In: Proceedings of the National Academy of Sciences, USA, 2554–2558.

    Google Scholar 

  • Teuvo Kohonen (1982a) Analysis of a simple self-organizing process. Biological Cybernetics, 44, 135–140.

    Article  Google Scholar 

  • Teuvo Kohonen (1982b) Clustering, taxonomy, and topological maps of patterns. In: Proceedings of the Sixth International Conference on Pattern Recognition. Silver Spring, MD: IEEE Computer Society Press.

    Google Scholar 

  • Teuvo Kohonen (1982c) Self-organized formation of topologically correct feature maps. Biological Cybernetics, 43, 59–69.

    Article  Google Scholar 

  • Teuvo Kohonen (1984) Self-Organization and Associative Memory. Berlin: Springer-Verlag.

    Google Scholar 

  • Janet L. Kolodner (1983a) Maintaining organization in a dynamic long-term memory. Cognitive Science, 7, 243–280.

    Article  Google Scholar 

  • Janet L. Kolodner (1983b) Reconstructive memory: a computer model. Cognitive Science, 7, 281–328.

    Article  Google Scholar 

  • James L. McClelland & Alan H. Kawamoto (1986) Mechanisms of sentence processing: assigning roles to constituents. In: James L. McClelland & David E. Rumelhart (Eds) Parallel Distributed Processing: Explorations in the Microstructure of Cognition. Volume II: Psychological and Biological Models. Cambridge, MA: MIT Press.

    Google Scholar 

  • Risto Miikkulainen (1987) Self-Organizing Process Based on Lateral Inhibition and Weight Redistribution. Technical Report UCLA-AI-87-16, Artificial Intelligence Laboratory, Computer Science Department, University of California, Los Angeles.

    Google Scholar 

  • Risto Miikkulainen (1990) A Neural Network Model of Script Processing and Memory. Technical Report UCLA-AI-90-03, Artificial Intelligence Laboratory, Computer Science Department, University of California, Los Angeles.

    Google Scholar 

  • Risto Miikkulainen & Michael G. Dyer (1989a) Encoding input/output representations in connectionist cognitive systems. In: David S. Touretzky, Geoffrey E. Hinton & Terrence J. Sejnowski (Eds) Proceedings of the 1988 Connectionist Models Summer School. Los Altos, CA: Morgan Kaufmann Publishers.

    Google Scholar 

  • Risto Miikkulainen & Michael G. Dyer (1989b) A modular neural network architecture for sequential paraphrasing of script-based stories. In: Proceedings of the International Joint Conference on Neural Networks. Piscataway, NJ: IEEE.

    Google Scholar 

  • Marvin Minsky (1981) A framework for representing knowledge. In: John Haugeland (Ed.) Mind Design: Philosophy, Psychology, Artificial Intelligence. Cambridge, MA: MIT Press.

    Google Scholar 

  • Helge J. Ritter & Klaus J. Schulten (1988) Convergency properties of Kohonen’s topology conserving maps: fluctuations, stability and dimension selection. Biological Cybernetics, 60, 59–71.

    Article  Google Scholar 

  • A. J. Sanford & S. C. Garrod (1981) Understanding Written Language. Chichester: Wiley.

    Google Scholar 

  • Roger Schank & Robert Abelson (1977) Scripts, Plans, Goals, and Understanding—An Inquiry into Human Knowledge Structures. The Artificial Intelligence Series. Hillsdale, NJ: Lawrence Erlbaum.

    Google Scholar 

  • N. E. Sharkey & D. C. Mitchell (1985) Word recognition in a functional context: the use of scripts in reading. Journal of Memory and Language, 24, 253–270.

    Article  Google Scholar 

  • N. E. Sharkey & A. J. C. Sharkey (1987) What’s the point of integration? The loci of knowledge based facilitation in sentence processing. Journal of Memory and Language, 26, 255–276.

    Article  Google Scholar 

  • Noel E. Sharkey, R.F.E. Sutcliffe & W.R. Wobcke (1986) Mixing binary and continuous connection schemes for knowledge access. In: Proceedings of the Sixth National Conference on Artificial Intelligence. Los Altos, CA: Morgan Kaufmann Publishers.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer Science+Business Media Dordrecht

About this chapter

Cite this chapter

Miikkulainen, R. (1992). Script Recognition with Hierarchical Feature Maps. In: Sharkey, N. (eds) Connectionist Natural Language Processing. Springer, Dordrecht. https://doi.org/10.1007/978-94-011-2624-3_10

Download citation

  • DOI: https://doi.org/10.1007/978-94-011-2624-3_10

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-94-010-5160-6

  • Online ISBN: 978-94-011-2624-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics