In this paper we explore continuous time recurrent networks for grammatical induction. A higher-level generating/processing scheme can be used to tackle the grammar induction problem. Experiments are performed on several types of grammars, including a family of languages known as Tomita languages and a context-free language. The system and the experiments demonstrate that continuous time recurrent networks can learn certain grammatical induction tasks.
CITATION STYLE
Chen, J., & Wermter, S. (1998). Continuous Time Recurrent Neural Networks for Grammatical Induction (pp. 381–386). https://doi.org/10.1007/978-1-4471-1599-1_56
Mendeley helps you to discover research relevant for your work.