his.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
A Comparison of Simple Recurrent and Sequential Cascaded Networks for Formal Language Recognition
University of Skövde, Department of Computer Science.
1999 (English)Independent thesis Advanced level (degree of Master (One Year))Student thesis
Abstract [en]

Two classes of recurrent neural network models are compared in this report, simple recurrent networks (SRNs) and sequential cascaded networks (SCNs) which are first- and second-order networks respectively. The comparison is aimed at describing and analysing the behaviour of the networks such that the differences between them become clear. A theoretical analysis, using techniques from dynamic systems theory (DST), shows that the second-order network has more possibilities in terms of dynamical behaviours than the first-order network. It also revealed that the second order network could interpret its context with an input-dependent function in the output nodes. The experiments were based on training with backpropagation (BP) and an evolutionary algorithm (EA) on the AnBn-grammar which requires the ability to count. This analysis revealed some differences between the two training-regimes tested and also between the performance of the two types of networks. The EA was found to be far more reliable than BP in this domain. Another important finding from the experiments was that although the SCN had more possibilities than the SRN in how it could solve the problem, these were not exploited in the domain tested in this project

Place, publisher, year, edition, pages
Skövde: Institutionen för datavetenskap , 1999. , 143 p.
Keyword [en]
Recurrent Neural Networks Formal Language
National Category
Information Science
Identifiers
URN: urn:nbn:se:his:diva-391OAI: oai:DiVA.org:his-391DiVA: diva2:2761
Presentation
(English)
Uppsok
Social and Behavioural Science, Law
Supervisors
Available from: 2007-12-12 Created: 2007-12-12 Last updated: 2009-10-09

Open Access in DiVA

fulltext(5660 kB)130 downloads
File information
File name FULLTEXT01.psFile size 5660 kBChecksum SHA-1
98723609a2612b8e08a4b06661754bb24dbf2b85377265514db7dd3ea652a62858d04f6f
Type fulltextMimetype application/postscript
fulltext(731 kB)73 downloads
File information
File name FULLTEXT02.pdfFile size 731 kBChecksum SHA-512
2b8f51d44ae035db2be2e0ffc983b4d7bc9fdafca171136c7d770cfdefd464e6f8ec3f69eed4102aa4143046f00e7e41da04445adeca5e54f2f87eacc3a32e4b
Type fulltextMimetype application/pdf

By organisation
Department of Computer Science
Information Science

Search outside of DiVA

GoogleGoogle Scholar
Total: 203 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 146 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf