Concept

Government and binding theory

Government and binding (GB, GBT) is a theory of syntax and a phrase structure grammar in the tradition of transformational grammar developed principally by Noam Chomsky in the 1980s. This theory is a radical revision of his earlier theories and was later revised in The Minimalist Program (1995) and several subsequent papers, the latest being Three Factors in Language Design (2005). Although there is a large literature on government and binding theory which is not written by Chomsky, Chomsky's papers have been foundational in setting the research agenda. The name refers to two central subtheories of the theory: government, which is an abstract syntactic relation applicable, among other things, to the assignment of case; and binding, which deals chiefly with the relationships between pronouns and the expressions with which they are co-referential. GB was the first theory to be based on the principles and parameters model of language, which also underlies the later developments of the minimalist program. The main application of the government relation concerns the assignment of case. Government is defined as follows: A governs B if and only if A is a governor and A m-commands B and no barrier intervenes between A and B. Governors are heads of the (V, N, A, P) and tensed I (T). A m-commands B if A does not dominate B and B does not dominate A and the first maximal projection of A dominates B, where the maximal projection of a head X is XP. This means that for example in a structure like the following, A m-commands B, but B does not m-command A: In addition, barrier is defined as follows: A barrier is any node Z such that Z is a potential governor for B and Z c-commands B and Z does not c-command A The government relation makes case assignment unambiguous. The tree diagram below illustrates how DPs are governed and assigned case by their governing heads: Another important application of the government relation constrains the occurrence and identity of traces as the requires them to be properly governed.

À propos de ce résultat
Cette page est générée automatiquement et peut contenir des informations qui ne sont pas correctes, complètes, à jour ou pertinentes par rapport à votre recherche. Il en va de même pour toutes les autres pages de ce site. Veillez à vérifier les informations auprès des sources officielles de l'EPFL.

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.