“…The structure builder will be able to generate a very large number of structures, the vast majority of which will have to be rejected. The effort required to deal with these ill‐formed structures will quickly overwhelm the parsing process (for relevant discussion, see Marcus, ; Berwick and Weinberg, ; Abney,
; and Kolb and Thiersch,
). Here's a toy example from Neeleman and Van de Koot,
which illustrates the growth of candidate structures for a given input depending on how many grammatical constraints are incorporated in the structure builder:
-
| A | B | C | D | E |
Men (1 word) | 1 | 1 | 1 | 2 | 1 |
Men slept (2 words) | 2 | 2 | 1 | 4 | 1 |
The man slept (3 words) | 12 | 8 | 2 | 8 | 1 |
Men bought a book (4 words) | 112 | 40 | 5 | 16 | 1 |
A man bought a book (5 words) | 1360 | 224 | 14 | 32 | 1 |
Men said men bought a book (6 words) | 19872 | 1344 | 42 | 64 | 1 |
Men said a man bought a book (7 words) | ? | 8448 | 132 | 128 | 1 |
A: merge with weak inclusiveness and binary branching built in B: merge with strong inclusiveness and binary branching built in C: merge with strong inclusiveness, binary branching and label assignment under directionality built in D: 2 n E: merge with strong inclusiveness, binary branching, label assignment under directionality and selection built in |
It is not important to know the nature of the grammatical constraints referred to (‘weak inclusiveness’, ‘binary branching’, etc.).…”