The Neural Network Pushdown Automaton: Model, Stack and Learning Simulations
| dc.contributor.author | Sun, G.Z. | en_US |
| dc.contributor.author | Giles, C. Lee | en_US |
| dc.contributor.author | Chen, H.H. | en_US |
| dc.contributor.author | Lee, Y.C. | en_US |
| dc.date.accessioned | 2004-05-31T22:23:50Z | |
| dc.date.available | 2004-05-31T22:23:50Z | |
| dc.date.created | 1993-08 | en_US |
| dc.date.issued | 1998-10-15 | en_US |
| dc.description.abstract | In order for neural networks to learn complex languages or grammars, they must have sufficient computational power or resources to recognize or generate such languages. Though many approaches have been discussed, one obvious approach to enhancing the processing power of a recurrent neural network is to couple it with an external stack memory - in effect creating a neural network pushdown automata (NNPDA). This paper discusses in detail this NNPDA - its construction, how it can be trained and how useful symbolic information can be extracted from the trained network. In order to couple the external stack to the neural network, an optimization method is developed which uses an error function that connects the learning of the state automaton of the neural network to the learning of the operation of the external stack. To minimize the error function using gradient descent learning, an analog stack is designed such that the action and storage of information in the stack are continuous. One interpretation of a continuous stack is the probabilistic storage of and action on data. After training on sample strings of an unknown source grammar, a quantization procedure extracts from the analog stack and neural network a discrete pushdown automata (PDA). Simulations show that in learning deterministic context-free grammars - the balanced parenthesis language, 1n0n, and the deterministic Palindrome - the extracted PDA is correct in the sense that it can correctly recognize unseen strings of arbitrary length. In addition, the extracted PDAs can be shown to be identical or equivalent to the PDAs of the source grammars which were used to generate the training strings. (Also cross-referenced as UMIACS-TR-93-77.) | en_US |
| dc.format.extent | 371023 bytes | |
| dc.format.mimetype | application/postscript | |
| dc.identifier.uri | http://hdl.handle.net/1903/594 | |
| dc.language.iso | en_US | |
| dc.relation.isAvailableAt | Digital Repository at the University of Maryland | en_US |
| dc.relation.isAvailableAt | University of Maryland (College Park, Md.) | en_US |
| dc.relation.isAvailableAt | Tech Reports in Computer Science and Engineering | en_US |
| dc.relation.isAvailableAt | UMIACS Technical Reports | en_US |
| dc.relation.ispartofseries | UM Computer Science Department; CS-TR-3118 | en_US |
| dc.relation.ispartofseries | UMIACS; UMIACS-TR-93-77. | en_US |
| dc.title | The Neural Network Pushdown Automaton: Model, Stack and Learning Simulations | en_US |
| dc.type | Technical Report | en_US |