See this document in CiteSeerX!

On the Ability of Recurrent Nets to Learn Deeply Embedded Structures  (Make Corrections)  
Mikael Bodén, Janet Wiles, Bradley Tonkes, Alan Blair



  Home/Search   Context   Related

 
View or download:
nec.com/~giles/IJCAI99/paper...boden.ps
uq.edu.au/~mikael/ijcai99ws.ps.Z
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  nec.com/homepages/gile...workshop (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: This paper investigates the reasons for the poor performance on learning deeply embedded structure in light of simulations using the context-free language a (Update)

Similar documents (at the sentence level):
41.4%:   Learning to predict a context-free language.. - Bodén.. (1999)   (Correct)

Active bibliography (related documents):   More   All
0.3:   Evolving Context-Free Language Predictors - Bodén, Jacobsson, Ziemke (2000)   (Correct)
0.2:   Evolving recurrent networks for context-free language .. - Bodén.. (2000)   (Correct)
0.1:   On the Correspondence between Neural Folding Architectures and.. - Küchler (1998)   (Correct)

Similar documents based on text:   More   All
0.6:   Context-Free and Context-Sensitive Dynamics in Recurrent.. - Bodén, Wiles (2000)   (Correct)
0.5:   Getting the Point Across: The Effect of Recurrent Network.. - Tonkes, Blair, Wiles (1999)   (Correct)
0.5:   LSTM Recurrent Networks Learn Simple Context Free and.. - Gers, Schmidhuber (2001)   (Correct)

BibTeX entry:   (Update)

@misc{ eacute-ability,
  author = "Mikael Bodén and Janet Wiles and Bradley Tonkes and Alan Blair",
  title = "On the Ability of Recurrent Nets to Learn Deeply Embedded Structures",
  url = "citeseer.ist.psu.edu/247451.html" }
Citations (may not include all citations):
240   In Advances in Neural Information Processing Systems (context) - Neural, Systems et al. - 1990
145   Learning and extracting finite state automata with second-or.. (context) - Giles, Miller et al. - 1992
141   The induction of dynamical recognizers - Pollack - 1991
82   Learning and development in neural networks: The importance .. - Elman - 1993
29   Toward a connectionist model of recursion in human linguisti.. - Christiansen, Chater - 1999
25   Learning to count without a counter: A case study of dynamic.. - Wiles, Elman - 1995
19   Discrete recurrent neural networks for grammatical inference (context) - Zheng, Goodman et al. - 1994
13   Using prior knowledge in an NNPDA to learn context-free lang.. - Das, Giles et al. - 1993
8   Finite state automata and simple recurrent neural networks N.. (context) - Cleeremans, Servan-Schreiber et al. - 1989
4   A recurrent neural network that learns to count (context) - Learning, Rodriguez et al. - 1999
1   and Lehmann (context) - Holldobler, Kalinke - 1997

Documents on the same site (http://www.neci.nj.nec.com/homepages/giles/IJCAI99/workshop.html):   More
Clustering Time Series with Hidden Markov Models and Dynamic Time.. - Oates (1999)   (Correct)
Learning Simple Phonotactics - Tjong, Sang, Nerbonne (1999)   (Correct)
Hidden-Mode Markov Decision Processes - Samuel Choi Dit-Yan (1999)   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC