ISSN:
1573-773X
Keywords:
recurrent neural network
;
grammatical inference
;
finite-state automata
;
regular grammar
;
tomita grammars
Source:
Springer Online Journal Archives 1860-2000
Topics:
Computer Science
Notes:
Abstract In this study, we proposed an adaptive recurrent neural network that is capable of inferring a regular grammar, and at the same time of extracting the underlying grammatical rules emulated by a finite-state automata. Our proposed network adapts from an initial analog phase, which has good training behavior, to a discrete phase for automatic rule extraction. A modified objective function is proposed to accomplish the discretisation process as well as logic learning. Comparison on learning Tomita grammars shows that our network has a significant advantage over other approaches.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1023/A:1009673616664
Permalink