2017
DOI: 10.15398/jlm.v5i1.157
|View full text |Cite
|
Sign up to set email alerts
|

Relative clauses as a benchmark for Minimalist parsing

Abstract: Minimalist grammars have been used recently in a series of papers to explain well-known contrasts in human sentence processing in terms of subtle structural differences. These proposals combine a top-down parser with complexity metrics that relate parsing difficulty to memory usage. So far, though, there has been no large-scale exploration of the space of viable metrics. Building on this earlier work, we compare the ability of 1600 metrics to derive several processing effects observed with relative clauses, ma… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

1
23
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
4
1
1

Relationship

0
6

Authors

Journals

citations
Cited by 24 publications
(24 citation statements)
references
References 35 publications
1
23
0
Order By: Relevance
“…Extending previous work on MG parsing (Kobele et al, 2013;Graf and Marcinek, 2014;Gerth, 2015), Graf et al (2017) distinguish three cognitive notions of memory usage: I) how long a node is kept in memory (tenure); II) how many nodes must be kept in memory (payload); or III) how many bits a node consumes in memory (size). Tenure and payload for each node n in the tree can be easily computed via the node annotation scheme of Kobele et al: a node's tenure is equal to the difference between its index and its outdex; the payload of a derivation tree is computed as the number of nodes with a tenure strictly greater than 2.…”
Section: Complexity Metricsmentioning
confidence: 95%
See 4 more Smart Citations
“…Extending previous work on MG parsing (Kobele et al, 2013;Graf and Marcinek, 2014;Gerth, 2015), Graf et al (2017) distinguish three cognitive notions of memory usage: I) how long a node is kept in memory (tenure); II) how many nodes must be kept in memory (payload); or III) how many bits a node consumes in memory (size). Tenure and payload for each node n in the tree can be easily computed via the node annotation scheme of Kobele et al: a node's tenure is equal to the difference between its index and its outdex; the payload of a derivation tree is computed as the number of nodes with a tenure strictly greater than 2.…”
Section: Complexity Metricsmentioning
confidence: 95%
“…In order to do so, these notions of memory have been used to define a vast set of complexity metrics measuring processing difficulty over a full derivation tree. In this paper, we look at Italian relative clause asymmetries using the full set of 1600 metrics as defined in Graf et al (2017). However, in what follows we only give a general intuition of how such metrics can be defined, and we refer the reader to Graf et al for the detailed formal definitions.…”
Section: Complexity Metricsmentioning
confidence: 99%
See 3 more Smart Citations