Issue No. 01 - January/February (2000 vol. 12)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/69.842255
<p><b>Abstract</b>—This paper examines the inductive inference of a complex grammar with neural networks—specifically, the task considered is that of training a network to classify natural language sentences as grammatical or ungrammatical, thereby exhibiting the same kind of discriminatory power provided by the Principles and Parameters linguistic framework, or Government-and-Binding theory. Neural networks are trained, without the division into learned vs. innate components assumed by Chomsky, in an attempt to produce the same judgments as native speakers on sharply grammatical/ungrammatical data. How a recurrent neural network could possess linguistic capability and the properties of various common recurrent neural network architectures are discussed. The problem exhibits training behavior which is often not present with smaller grammars and training was initially difficult. However, after implementing several techniques aimed at improving the convergence of the gradient descent backpropagation-through-time training algorithm, significant learning was possible. It was found that certain architectures are better able to learn an appropriate grammar. The operation of the networks and their training is analyzed. Finally, the extraction of rules in the form of deterministic finite state automata is investigated.</p>
Recurrent neural networks, natural language processing, grammatical inference, government-and-binding theory, gradient descent, simulated annealing, principles-and-parameters framework, automata extraction.
C. Lee Giles, Steve Lawrence, Sandiway Fong, "Natural Language Grammatical Inference with Recurrent Neural Networks", IEEE Transactions on Knowledge & Data Engineering, vol. 12, no. , pp. 126-140, January/February 2000, doi:10.1109/69.842255