| Lemma | checking configuration |
|---|---|
| Categoria grammaticale | N |
| Lingua | inglese |
| Sigla | Chomsky (1995) |
| Titolo | The Minimalist Program |
| Sinonimi | |
| Rinvii | |
| Traduzioni | |
| Citazioni | We now distinguish between a checking “configuration” and a checking “relation”. Suppose that K attracts F, which raises to form {H (K), {α, K}}; here α = F if the operation is covert, and α includes whatever is required for convergence if the operation is overt. Each feature of FF[F] (including F) is in the checking domain of each sublabel “f” of K. We now say that (109) Feature F’ of FF[F] is in a “checking configuration” with “f”; and F’ is in a “checking relation” with “f” if, furthermore, F’ and “f” match. |