Advertisement

A connectionist parser for context-free phrase structure grammars

  • Rolf Wilkens
  • Helmut Schnelle
Part of the Informatik-Fachberichte book series (INFORMATIK, volume 252)

Abstract

Most connectionist networks in present use employ built-in learning algorithms. Their major disadvantage however is their inability to handle complex knowledge structures. In this paper a connectionist network is presented which can handle highly developed cognitive structures not by making use of learning processes but by the integration of a powerful initial structure. Parsing of context-free phrase structure grammars shall exemplify the workings of the network.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Feldman, J.A. (1988) “Structured neural networks in nature and in computer science.” In: Eckmiller, R. & v.d.Malsburg, Chr. Neural Computers, Berlin etc.: Springer.Google Scholar
  2. Fodor, J.A. & Pylyshyn, Z.W. (1988) “Connectionism and cognitive architecture, A critical analysis”, Cognition28: 3–71.CrossRefGoogle Scholar
  3. Hoelter, M. (1990) “Net-linguistic representation of complex feature structures”. unpublished Ms. Ruhr-Universität BochumGoogle Scholar
  4. Schnelle, H. & Doust, R. (1989) “A net-linguistic ”Earley“ chart-parser.” To appear in: Reilly, R. Sc Sharkey, N. Connectionist approaches to language. Vol. 1. Amsterdam: North Holland.Google Scholar
  5. Wilkens, R. (1990) “Ein netzlinguistischer Parser für kontextfreie Phrasenstrukturgrammatiken” M.A. thesis. Ruhr-Universität Bochum, Sprachwissenschaftliches Institut.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1990

Authors and Affiliations

  • Rolf Wilkens
    • 1
  • Helmut Schnelle
    • 1
  1. 1.Sprachwissenschaftliches InstitutRuhr-Universität BochumBochum 1Germany

Personalised recommendations