Difference between revisions of "Checking relation"
Jump to navigation
Jump to search
Linguipedia (talk | contribs) (New page: Within checking theory of the Minimalist Program, two features can enter into a '''checking relation''' if (i) the features match, and (ii) they are in a [[checking configurat...) |
Haspelmath (talk | contribs) m |
||
| Line 1: | Line 1: | ||
| − | |||
Within [[checking theory]] of the [[Minimalist Program]], two features can enter into a '''checking relation''' if | Within [[checking theory]] of the [[Minimalist Program]], two features can enter into a '''checking relation''' if | ||
| Line 13: | Line 12: | ||
{{dc}} | {{dc}} | ||
| − | [[Category: | + | [[Category:Syntax]] |
| + | [[Category:Minimalism]] | ||
Latest revision as of 04:45, 7 October 2007
Within checking theory of the Minimalist Program, two features can enter into a checking relation if
(i) the features match, and
(ii) they are in a checking configuration.
Link
Checking relation in Utrecht Lexicon of Linguistics
Reference
Chomsky, Noam A. 1995. The Minimalist program. Cambridge, MA: MIT Press.
