Minimalist grammar

Minimalist grammars are a class of formal grammars that aim to provide a more rigorous, usually proof-theoretic, formalization of Chomskyan Minimalist program than is normally provided in the mainstream Minimalist literature. A variety of particular formalizations exist, often developed by Edward Stabler, Alain Lecomte, Christian Retoré, or combinations thereof.

Lecomte and Retoré's extensions of the Lambek Calculus

Lecomte and Retoré (2001) [1] introduces a formalism that modifies that core of the Lambek Calculus to allow for movement-like processes to be described without resort to the combinatorics of Combinatory categorial grammar. The formalism is presented in proof-theoretic terms. Differing only slightly in notation from Lecomte and Retoré (2001), we can define a minimalist grammar as a 3-tuple G = (C,F,L), where C is a set of "categorial" features, F is a set of "functional" features (which come in two flavors, "weak", denoted simply f, and "strong", denoted f*), and L is a set of lexical atoms, denoted as pairs w:t, where w is some phonological/orthographic content, and t is a syntactic type defined recursively as follows:

all features in C and F are (atomic) types, and
if X and Y are types, so are X/Y, X\Y, and X \circ Y are types.

We can now define 6 inferences rules:


\vdash w : X, for all w : X \in L


w : X \vdash w : X, for all w : X \notin L


\frac{\Gamma \vdash a : X/Y \qquad \Gamma' \vdash b : Y}{\Gamma; \Gamma' \vdash ab : X}[/E]


\frac{\Gamma' \vdash b : Y \qquad \Gamma \vdash a : X\backslash Y}{\Gamma'; \Gamma \vdash ba : X}[\backslash E]


\frac{\Gamma; \Gamma' \vdash \alpha}{\Gamma, \Gamma' \vdash \alpha} entropy


\frac{\Gamma \vdash a : X \circ Y \qquad \Delta, b : X, c : Y, \Delta' \vdash d : Z}{\Delta, \Gamma, \Delta' \vdash d[b := a, c := a] : Z}[\circ E]


The first rule merely makes it possible to use lexical items with no extra assumptions. The second rule is just a means of introducing assumptions into the derivation. The third and fourth rules just perform directional feature checking, combining the assumptions required to build the subparts that are being combined. The entropy rule presumably allows the ordered sequents to be broken up into unordered sequents. And finally, the last rule implements "movement" by means of assumption elimination.

Th last rule can be given a number of different interpretations in order to fully mimic movement of the normal sort found in the Minimalist Program. The account given by Lecomte and Retoré (2001) is that if one of the product types is a strong functional feature, then the phonological/orthographic content associated with that type on the right is substituted with the content of the a, and the other is substituted with the empty string; whereas if neither is strong, then the phonological/orthographic content is substituted for the category feature, and the empty string is substituted for the weak functional feature. That is, we can rephrase the rule as two sub-rules as follows:


\frac{\Gamma \vdash a : X \circ Y^{*} \qquad \Delta, b : X, c : Y^{*}, \Delta' \vdash d : Z}{\Delta, \Gamma, \Delta' \vdash d[b := \epsilon, c := a] : Z}[\circ E_{strong}] where X \in C, Y^{*} \in F


\frac{\Gamma \vdash a : X \circ Y \qquad \Delta, b : X, c : Y, \Delta' \vdash d : Z}{\Delta, \Gamma, \Delta' \vdash d[b := a, c := \epsilon] : Z}[\circ E_{weak}] where X \in C, Y \in F


Another alternative would be to construct pairs in the /E and \E steps, and use the \circ E rule as given, substituting the phonological/orthographic content a into the highest of the substitution positions, and the empty string in the rest of the positions. This would be more in line with the Minimalist Program, given that multiple movements of an item are possible, where only the highest position is "spelled out".

Example

As a simple example of this system, we can show how to generate the sentence who did John see with the following toy grammar:

Let G = ({N,S},{W},L), where L contains the following words:

\text{John} : N\
\text{see} : (S\backslash N)/N
\text{did} : (S\backslash W)/S
\text{who} : N \circ W

The proof for the sentence who did John see is therefore:

\dfrac{
	\vdash \text{who} : N \circ W
	\quad
	\dfrac{
		\text{x} : W \vdash \text{x} : W
		\quad
		\dfrac{
			\vdash \text{did} : (S\backslash W)/S
			\quad
			\dfrac{
				\vdash \text{John} : N
				\quad
				\dfrac{
					\text{y} : N \vdash \text{y} : N
					\quad
					\vdash \text{see} : (S\backslash N)/N
				}{
					\text{y} : N \vdash \text{see y} : S\backslash N
				}[/E]
			}{
				\text{y} : N \vdash \text{John see y} : S
			}[\backslash E]
		}{
			\text{y} : N \vdash \text{did John see y} : S\backslash W
		}[/E]
	}{
		\text{x} : W, \text{y} : N \vdash \text{x did John see y} : S
	}[\backslash E]
}{
	\vdash \text{who did John see} : S
}[\circ E]

References

  1. ^ Lecomte, A. and Retoré, C. 2001. Extending Lambek Grammars: a logical account of minimalist grammars. In Proceedings of the 39th Annual Meeting on Association for Computational Linguistics, pp. 362-369.

Wikimedia Foundation. 2010.

Look at other dictionaries:

  • Minimalist program — Linguistics …   Wikipedia

  • Transformational grammar — In linguistics, a transformational grammar, or transformational generative grammar (TGG), is a generative grammar, especially of a natural language, that has been developed in a Chomskyan tradition. Additionally, transformational grammar is the… …   Wikipedia

  • Generative grammar — In theoretical linguistics, generative grammar refers to a particular approach to the study of syntax. A generative grammar of a language attempts to give a set of rules that will correctly predict which combinations of words will form… …   Wikipedia

  • Formal grammar — In formal semantics, computer science and linguistics, a formal grammar (also called formation rules) is a precise description of a formal language ndash; that is, of a set of strings over some alphabet. In other words, a grammar describes which… …   Wikipedia

  • Stochastic context-free grammar — A stochastic context free grammar (SCFG; also probabilistic context free grammar, PCFG) is a context free grammar in which each production is augmented with a probability. The probability of a derivation (parse) is then the product of the… …   Wikipedia

  • Noam Chomsky — Chomsky redirects here. For other topics with the same name, see Chomsky (disambiguation). Noam Chomsky Noam Chomsky visiting Vancouver, Canada in 2004 …   Wikipedia

  • literature — /lit euhr euh cheuhr, choor , li treuh /, n. 1. writings in which expression and form, in connection with ideas of permanent and universal interest, are characteristic or essential features, as poetry, novels, history, biography, and essays. 2.… …   Universalium

  • performing arts — arts or skills that require public performance, as acting, singing, or dancing. [1945 50] * * * ▪ 2009 Introduction Music Classical.       The last vestiges of the Cold War seemed to thaw for a moment on Feb. 26, 2008, when the unfamiliar strains …   Universalium

  • Andrew Radford — Saltar a navegación, búsqueda Andrew Radford nació en un pueblo cerca a Guildford, en el sur de Londres. Estudió francés, italiano y rumano en la Universidad de Cambridge. Tiene un PhD en sintaxis inglesa. Trabajo en la Universidad de Essex y fue …   Wikipedia Español

  • Syntax — Syntactic redirects here. For another meaning of the adjective, see Syntaxis. For other uses, see Syntax (disambiguation). Linguistics …   Wikipedia


Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”

We are using cookies for the best presentation of our site. Continuing to use this site, you agree with this.