Extracting finite structure from infinite language

Tools

McQueen, T., Hopgood, A.A., Allen, T.J. ORCID: 0000-0001-6228-0237 and Tepper, J.A. ORCID: 0000-0001-7339-0132, 2005. Extracting finite structure from infinite language. Knowledge-Based Systems, 18 (4-5), pp. 135-141. ISSN 0950-7051

Preview

Text
196374_400 Tepper Postprint Proof.pdf - Post-print
Download (307kB) | Preview

Official URL: http://doi.org/10.1016/j.knosys.2004.10.010

Abstract

This paper presents a novel connectionist memory-rule based model capable of learning the finite-state properties of an input language from a set of positive examples. The model is based upon an unsupervised recurrent self-organizing map [T. McQueen, A. Hopgood, J. Tepper, T. Allen, A recurrent self-organizing map for temporal sequence processing, in: Proceedings of Fourth International Conference in Recent Advances in Soft Computing (RASC2002), Nottingham, 2002] with laterally interconnected neurons. A derivation of functionalequivalence theory [J. Hopcroft, J. Ullman, Introduction to Automata Theory, Languages and Computation, vol. 1, Addison-Wesley, Reading, MA, 1979] is used that allows the model to exploit similarities between the future context of previously memorized sequences and the future context of the current input sequence. This bottom-up learning algorithm binds functionally related neurons together to form states. Results show that the model is able to learn the Reber grammar [A. Cleeremans, D. Schreiber, J. McClelland, Finite state automata and simple recurrent networks, Neural Computation, 1 (1989) 372–381] perfectly from a randomly generated training set and to generalize to sequences beyond the length of those found in the training set.

Item Type:

Journal article

Publication Title:

Knowledge-Based Systems

Creators:

McQueen, T., Hopgood, A.A., Allen, T.J. and Tepper, J.A.

Publisher:

Elsevier (not including Cell Press)

Place of Publication:

Amsterdam

Date:

31 May 2005