Skip to main content
Springer Nature Link
Log in

Suprasymbolic Grammar Induction by Recurrent Self-Organizing Maps

  • Conference paper
Grammatical Inference: Algorithms and Applications (ICGI 2006)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 4201))

Included in the following conference series:

  • 548 Accesses

Abstract

A preliminary experimental result is reported on language identification tasks by Recurrent Self-Organization Maps (RSOM) with a context map layer, using English part-of-speech strings of variable length. With subsymbolic processing, RSOM suprasymbolically sublimed syntactic rules into a topological configuration.

The research reported here is partially supported by a 21st COE Program (#J19), granted to Kyushu Institute of Technology, by MEXT, Japan. The standard disclaimers apply.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Similar content being viewed by others

References

  1. Gold, E.M.: Language Identification in the Limit. Information and Control 10, 447–474 (1967)

    Article  MATH  Google Scholar 

  2. Kohonen, T.: Self-Organizing Maps. Springer, Heidelberg (1995)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. Brain Science and Engineering,  

    Fuminori Mizushima & Takashi Toyoshima

  2. Dept. Human Sciences, Kyushu Institute of Technology, 2-4 Hibikino, Wakamatsu, Kitakyushu, Fukuoka, 808-0196, Japan

    Takashi Toyoshima

Authors
  1. Fuminori Mizushima
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Takashi Toyoshima
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Biosciences and Informatics, Keio University, 3-14-1 Hiyoshi, Kohoku-ku, 223-8522, Yokohama, Japan

    Yasubumi Sakakibara

  2. Dept. of Computer Science, Kyoto Sangyo University, Kamigamo Motoyama, Kita-ku, Kyoto, Japan

    Satoshi Kobayashi

  3. Japan Biological Informatics Consortium, 10F TIME24 Building, 2-45 Aomi, Koto-ku, 135-8073, Tokyo, Japan

    Kengo Sato

  4. Department of Information and Communication Engineering, Graduate School of Electro-Communications, The University of Electro-Communications, 1-5-1 Chofugaoka, Chofu-shi, 182-8585, Tokyo, Japan

    Tetsuro Nishino

  5. Department of Information and Communication Engineering, Faculty of Electro-Communications, The University of Electro-Communications, Chofugaoka 1–5–1, Chofu, 182-8585, Tokyo, Japan

    Etsuji Tomita

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Mizushima, F., Toyoshima, T. (2006). Suprasymbolic Grammar Induction by Recurrent Self-Organizing Maps. In: Sakakibara, Y., Kobayashi, S., Sato, K., Nishino, T., Tomita, E. (eds) Grammatical Inference: Algorithms and Applications. ICGI 2006. Lecture Notes in Computer Science(), vol 4201. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11872436_31

Download citation

  • DOI: https://doi.org/10.1007/11872436_31

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-45264-5

  • Online ISBN: 978-3-540-45265-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics