Frazier and Fodor's Sausage Machine 1978 Flashcards

1
Q

what does this sausage machine do

A

attempts to explain phenomena identified by Kimball without the principles - why some sentences are to process and why structural ambiguities are missed.
less principles, describes how use of linguistic knowledge interacts with working memory limitations more precisely.
explains RA and exceptions to it
explains mispredictions

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

explain the sausage machine, 2 stage top-down parser

A
  1. preliminary phrase packager, ppp. attaches words to sentences within 6 word processing window (WM)
  2. sentence structure supervisor (SSS): assembles structures put together by PPP (sausages) into overall phrase marker (string of sausages) but doesn’t undo work of PPP.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

the principle of minimal attachment (one principle not 7 like Kimball)

A

MA, means parser always tries to make simplest attachment possible, when build structures, builds structure that requires you to create fewest nodes.
build simplest structure tree- so don’t see the more complex interpretation.
parser built with sausage machine structure.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

why does MA happen?

A

arises as natural outcome of race between alternative set of rules, creation of fewest nodes wins because its simplest and tasks least time to assemble.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

explain multiply centre embedded

A

difficulty of multiply centre embedded sentences explained in terms of lim capacity of WM (6 word viewing window) can’t process 2 centre embedded sentence as has left word viewing window, can’t make attachment b/c two parts of sentence never together in WM

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

RA by default

A

explains exceptions to RA in short sentences and apparent use of RA in longer ones.
Accord to sausage machine, does this because start of the sentence has left WM therefore don’t have minimal attachment possibility so therefore use RA.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

advantages of Sausage machine (3)

A

accounts for more data than Kimball in only 2 stage model of parsing.
provides much more explicit account of how parsers use of linguistic knowledge interacts w WM
makes strong predictions about difficulty of different kinds of sentences and how ambiguities are solved in short and longer sentences.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

empirical problems with the Sausage Model (3)

A

Wanner 1980- pointed out that strong predictions of model are actually incorrect
multiply centre embedded sentences with only 6 words should be easy to understand but just as difficult
claims to capture RA by default, fits in 6 word viewing window, both inters use same number nodes therefore no minimal attachment, following RA not by default- you are making the choice therefore sausage machine doesn’t capture it.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

evaluation of sausage machine

A

better model- clearly specified, clearer predictions.
starting point for important current model of parsing GPM (Frazier and Rayner)
good theory should explain lots of data with small no principles.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly