Views
Graph
Explorer
Focus
Down
Load 1 level
Load 2 levels
Load 3 levels
Load 4 levels
Load all levels
All
Dagre
Focus
Down
Load 1 level
Load 2 levels
Load 3 levels
Load 4 level
Load all levels
All
Tree
SpaceTree
Focus
Expanding
Load 1 level
Load 2 levels
Load 3 levels
Down
All
Down
Radial
Focus
Expanding
Load 1 level
Load 2 levels
Load 3 levels
Down
All
Down
Box
Focus
Expanding
Down
Up
All
Down
Page ✓
Article
Outline
Document
Down
All
Canvas
Time
Timeline
Calendar
Request email digest
Past 24 hours
Past 2 days
Past 3 days
Past week
Add
Add page
Add comment
Add citation
Edit
Edit page
Delete page
Share
Link
Bookmark
Embed
Social media
Login
Member login
Register now for a free account
🔎
Connectionist models don't implement classical models
TegenArgument
1
#886
Connectionist models of language, such as Seidenberg in McClelland (1989), do not implement a dual-route model, because the models can't be decomposed into separate systems to applying rules and handling exceptions.
Moreover, they behave in a behaviourally plausible ways not predicted by the dual-route model.
Mark Seidenberg, 1992.
PAGE NAVIGATOR
(Help)
-
Artificial Intelligence »
Artificial Intelligence
Artificial Intelligence☜A collaboratively editable version of Robert Horns brilliant and pioneering debate map Can Computers Think?—exploring 50 years of philosophical argument about the possibility of computer thought.☜F1CEB7
▲
Can computers think? [1] »
Can computers think? [1]
Can computers think? [1]☜Can a computational system possess all important elements of human thinking or understanding? ☜FFB597
▲
Yes: connectionist networks can think [5a] »
Yes: connectionist networks can think [5a]
Yes: connectionist networks can think [5a]☜Connectionist networks can possess all important elements of human thinking or understanding.☜59C6EF
▲
Connectionist networks can think without following rules »
Connectionist networks can think without following rules
Connectionist networks can think without following rules☜Like humans, connectionist networks exhibit fluid, intelligent behaviour without following rigid, explicit rules. In general, they are trained to exhibit intelligent behaviour rather than being programmed with rules. ☜98CE71
▲
The Past-Tense Acquisition Model »
The Past-Tense Acquisition Model
The Past-Tense Acquisition Model☜This implemented network model was trained to convert English phrases into the past tense. Although the network’s performance can be described by rules, no actual rules are utilised in its processing.☜98CE71
▲
Model doesn't argue against rule-based explanation »
Model doesn't argue against rule-based explanation
Model doesn't argue against rule-based explanation☜The past-tense model is problematic in numerous ways—eg it can’t represent certain words, it can’t learn certain rules, it learns rules found in no human language, and it fails at its assigned task of mastering the past tense of English.☜EF597B
▲
Any system can be described by a dual-route model »
Any system can be described by a dual-route model
Any system can be described by a dual-route model ☜Pinker and Prince postulate a dual-route model of linguistic knowledge, in which a set of rules—follow a rule or consult a list of exceptions—only has to fit some cases, with the rest treated as exceptions. But any systems describable this way.☜EF597B
■
Connectionist models don't implement classical models
Connectionist models don't implement classical models☜Connectionist models of language, such as Seidenberg in McClelland (1989), do not implement a dual-route model, because the models cant be decomposed into separate systems to applying rules and handling exceptions.☜EF597B
Heading
Summary
Click the button to enter task scheduling information
Open
Details
Enter task details
Message text
Select assignee(s)
Due date (click calendar)
RadDatePicker
RadDatePicker
Open the calendar popup.
Calendar
Title and navigation
Title and navigation
<<
<
November 2024
>
<<
November 2024
S
M
T
W
T
F
S
44
27
28
29
30
31
1
2
45
3
4
5
6
7
8
9
46
10
11
12
13
14
15
16
47
17
18
19
20
21
22
23
48
24
25
26
27
28
29
30
49
1
2
3
4
5
6
7
Reminder
No reminder
1 day before due
2 days before due
3 days before due
1 week before due
Ready to post
Copy to text
Enter
Cancel
Task assignment(s) have been emailed and cannot now be altered
Lock
Cancel
Save
Comment graphing options
Choose comments:
Comment only
Whole thread
All comments
Choose location:
To a new map
To this map
New map options
Select map ontology
Options
Standard (default) ontology
College debate ontology
Hypothesis ontology
Influence diagram ontology
Story ontology
Graph to private map
Cancel
Proceed
+Commentaar (
0
)
- Commentaar
Voeg commentaar toe
Newest first
Oldest first
Show threads
+Citaten (
0
)
- Citaten
Voeg citaat toe
List by:
Citerank
Map
+About
- About
Gemaakt door:
David Price
NodeID:
#886
Node type:
OpposingArgument
Gemaakt op (GMT):
8/14/2006 8:50:00 PM
Laatste bewerking (GMT):
10/23/2007 2:29:00 PM
Show other editors
Inkomende kruisrelatie
0
Uitgaande kruisrelatie
0
Gemiddelde waardering:
0
by
0
gebruikers
x
Select file to upload