Results 1  10
of
15
Generating Copies: An investigation into structural identity in language and grammar
, 2006
"... ..."
Minimalist Grammars and Recognition
"... Recent work has shown how basic ideas of the minimalist tradition intransformational syntax can be captured in a simple generative formalism, a"der:"AII] al minimalism." Thisfr]]I[L" can model "rel nant movement" analyses, which yield mor e complex antecedenttr ace r e ..."
Abstract

Cited by 14 (2 self)
 Add to MetaCart
Recent work has shown how basic ideas of the minimalist tradition intransformational syntax can be captured in a simple generative formalism, a"der:"AII] al minimalism." Thisfr]]I[L" can model "rel nant movement" analyses, which yield mor e complex antecedenttr ace r elations, suggesting a new and significant sense in which linguistic str ctur esar "chain based." Michaelis (1998) showed that these grI] mar cor" spond to a certain kind of linear context free r write system, and this paper takes the next step of adapting ther ecognition methods for "nonconcatenative"grOO[]" (Weir 1988; Seki et al., 1991; Boullier , 1999). This tur ns out to be quite straightforward once the grammars are set out appropriately.
Resource logics and minimalist grammars
 Proceedings ESSLLI’99 workshop (Special issue Language and Computation
, 2002
"... This ESSLLI workshop is devoted to connecting the linguistic use of resource logics and categorial grammar to minimalist grammars and related generative grammars. Minimalist grammars are relatively recent, and although they stem from a long tradition of work in transformational grammar, they are lar ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
(Show Context)
This ESSLLI workshop is devoted to connecting the linguistic use of resource logics and categorial grammar to minimalist grammars and related generative grammars. Minimalist grammars are relatively recent, and although they stem from a long tradition of work in transformational grammar, they are largely informal apart from a few research papers. The study of resource logics, on the other hand, is formal and stems naturally from a long logical tradition. So although there appear to be promising connections between these traditions, there is at this point a rather thin intersection between them. The papers in this workshop are consequently rather diverse, some addressing general similarities between the two traditions, and others concentrating on a thorough study of a particular point. Nevertheless they succeed in convincing us of the continuing interest of studying and developing the relationship between the minimalist program and resource logics. This introduction reviews some of the basic issues and prior literature. 1 The interest of a convergence What would be the interest of a convergence between resource logical investigations of
ProofNets, hybrid logics and minimalist representations
 In Mathematics of Language 6
, 1999
"... . In this paper, we aim at giving a logical account of the representationalist view on minimalist grammars by refering to the notion of ProofNet in Linear Logic. We propose at the same time a hybrid logic, which mixes one logic (Lambek calculus) for building up elementary proofs and another one for ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
(Show Context)
. In this paper, we aim at giving a logical account of the representationalist view on minimalist grammars by refering to the notion of ProofNet in Linear Logic. We propose at the same time a hybrid logic, which mixes one logic (Lambek calculus) for building up elementary proofs and another one for combining the proofs so obtained. Because the first logic is non commutative and the second one is commutative, this brings us a way to combine commutativity and non commutativity in the same framework. The dynamic of cutelimination in proofnets is used to formalise the moveoperation. Otherwise, we advocate a proofnet formalism which allows us to consider formulae as nodes to which it is possible to assign weights which determine the final phonological interpretation. Keywords: generative grammar, typelogical grammar, linear logic, proofnets, hybrid logics 1. Introduction The basic idea concerning the use of Proofnets is to consider words and expressions as building blocks in the ...
Syntactic amalgams as dynamic constituency in topdown derivations
"... phenomenon under investigation here is syntactic amalgamation (Lakoff 1974, Tsubomoto & Whitman 2000), which seems to exhibit a constituency paradox if analyzed from the point of view of either a representational approach or a bottomup derivational approach, requiring extra hidden structure alo ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
phenomenon under investigation here is syntactic amalgamation (Lakoff 1974, Tsubomoto & Whitman 2000), which seems to exhibit a constituency paradox if analyzed from the point of view of either a representational approach or a bottomup derivational approach, requiring extra hidden structure along with ad hoc ellipsis and sluicing rules parasitic on one another. Once the directionality of derivation is ‘corrected’, and constituency is taken to be dynamic, the paradox disappears with no need for additional constructionspecific machinery.
Syntax and Semantics in Minimalist Grammars
 ESSLLI ’09
, 2009
"... This chapter presents a grammar for a fragment of English Amovement. The constructions accounted for include raising, passivization, and control. Section 1 motivates our basic syntactic theory, culminating in an account of raising and passivization, along with a novel account of expletive it, which ..."
Abstract
 Add to MetaCart
This chapter presents a grammar for a fragment of English Amovement. The constructions accounted for include raising, passivization, and control. Section 1 motivates our basic syntactic theory, culminating in an account of raising and passivization, along with a novel account of expletive it, which immediately explains the ban on superraising in terms of independently motivated notions of intervention and case assignment. Section 2 presents a directly compositional semantics for our syntactic theory, one which maps derivations incrementally to modeltheoretic objects, making no reference to syntactic trees. We extend our fragment with quantifiers, and show how we can derive quantifier scope ambiguities without a seperate operation of quantifier raising (QR). The tense clause boundedness of QR is easily shown to be simply and directly replicable in our system in terms of independently motivated assumptions about feature checking. We extend our fragment once more to account for control, which, given our semantic operations, is naturally implemented in terms of movement to theta positions. This treatment
Semantic Aspects of Minimalist Grammars ∗ Extended Abstract
"... Minimalist grammars are a rich lexicalized syntactic formalism which inherits the depth and wide covering of the generative tradition. Nevertheless up to now there is no straightforward way to extract the predicative structure of a sentence from syntactic analyses and from the predicative structure ..."
Abstract
 Add to MetaCart
Minimalist grammars are a rich lexicalized syntactic formalism which inherits the depth and wide covering of the generative tradition. Nevertheless up to now there is no straightforward way to extract the predicative structure of a sentence from syntactic analyses and from the predicative structure of the lexical items. In this paper we try to apply to this richer syntactic model the traditional correspondence between categorial grammars and Montague semantics. A similar correspondence between syntax and semantics is obtained via a description of minimalist grammars as a deductive system.
unknown title
"... Towards a minimal logic for minimalist grammars: a transformational use of Lambek calculus A. LECOMTE &C.RETORÉ ABSTRACT. Many convergence points have been observed during the recent years between the Minimalist Program and the program of Categorial Grammar, above all since the formalization of ..."
Abstract
 Add to MetaCart
Towards a minimal logic for minimalist grammars: a transformational use of Lambek calculus A. LECOMTE &C.RETORÉ ABSTRACT. Many convergence points have been observed during the recent years between the Minimalist Program and the program of Categorial Grammar, above all since the formalization of minimalist ideas by E. Stabler. For instance, the Mergeoperation is exactly like functional application. Moreover the fundamental operation of featurechecking, which is at the basis of the Moveoperation, can really be depicted as a resource consumption procedure, something familiar to so called resource conscious logics. This makes rise a deep interest in looking for a logical formulation of minimalist grammars. Such an enterprise is not done for the sake of spurious formalization. If we take the chomskyan framework seriously, it seems natural to assume that UG consists in a very general set of principles that must be expressed in the most condensed way, and that derivations are made of steps of a few different sorts exactly like it is the case in a logic.