Results 1 
6 of
6
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
Filtering Left Dislocation Chains in Parsing Categorial Grammar
"... This paper reports on a way to reduce the complexity of the process of left dislocation (re)construction for categorial grammar in the case of lexically assigned gaps, as an additional restriction on the complexity arising from lexical polymorphism in general. Specifying extraction sites lexically h ..."
Abstract
 Add to MetaCart
(Show Context)
This paper reports on a way to reduce the complexity of the process of left dislocation (re)construction for categorial grammar in the case of lexically assigned gaps, as an additional restriction on the complexity arising from lexical polymorphism in general. Specifying extraction sites lexically has the advantage that the combinatory explosion can be contained in the preparsing track by a specialized constraint on the expansion of sequences of categories. This constraint is called the Left Dislocation Chain Filter and is implemented by a Finite State Transducer. It is shown that the Filter can reduce the number of full string assignments under consideration prior to parsing with an average of one half to one order of magnitude, depending on the nature of the sentence. 1 Parsing Left Dislocation Left dislocation is a very common, almost universal phenomenon in natural languages. It establishes the relation between an element at the left periphery of a clause and a particular, lexical...
Parsing Natural Language using LDS: A Prototype
, 1997
"... This paper describes a prototype implementation of a Labelled Deduction System for natural language interpretation [Gabbay & Kempson 1992], where interpretation is taken to be the process of understanding a natural language utterance. The implementation models the process of understanding whgap ..."
Abstract
 Add to MetaCart
(Show Context)
This paper describes a prototype implementation of a Labelled Deduction System for natural language interpretation [Gabbay & Kempson 1992], where interpretation is taken to be the process of understanding a natural language utterance. The implementation models the process of understanding whgap dependencies in questions and relative clauses for a fragment of English. The paper is divided in three main sections. In section 1, we introduce the basic architecture of the system. Section 2 outlines a prototype implementation of whbinding and indicates its potential for explanation of linguistic phenomena, and in Section 3 we briefly set the model within a larger theoretical perspective, comparing it to other typelogical approaches to natural language analysis. 0 A Brief Background on LDSNL In LDSNL , natural language understanding is modelled as a syntactic process mapping lexical items onto representations in some logical system. The outcome of the interpretation process is taken to be...
A Minimal Deductive System for Minimalism
"... This paper proposes to answer some questions concerning economy in computation and language by giving a very compact set of deductive rules (based on the socalled Lambek calculus, enriched with an exchange modality) which embodies all the properties of Minimalist Grammars (Stabler, [15]). moveff i ..."
Abstract
 Add to MetaCart
This paper proposes to answer some questions concerning economy in computation and language by giving a very compact set of deductive rules (based on the socalled Lambek calculus, enriched with an exchange modality) which embodies all the properties of Minimalist Grammars (Stabler, [15]). moveff is replaced by a logical operation, very similar in its effects to Form Chain, technically known as the productelimination rule, which inserts a lexical or syntactic object at (at least) two positions at the same time. Non commutativity of the system ensures HMC. Moreover the precise formulation of the system enables us to show what kinds of languages can be captured and it is then an empirical question to verify that some natural languages exist, which present similarities with them. We can therefore say that formalization leads to a hypotheticodeductive approach in linguistics. 1
A Labelled Analytic Theorem Proving Environment for Categorial Grammar
, 1995
"... We present a system for the investigation of computational properties of categorial grammar parsing based on a labelled analytic tableaux theorem prover. This proof method allows us to take a modular approach, in which the basic grammar can be kept constant, while a range of categorial calculi can b ..."
Abstract
 Add to MetaCart
We present a system for the investigation of computational properties of categorial grammar parsing based on a labelled analytic tableaux theorem prover. This proof method allows us to take a modular approach, in which the basic grammar can be kept constant, while a range of categorial calculi can be captured by assigning different properties to the labelling algebra. The theorem proving strategy is particularly well suited to the treatment of categorial grammar, because it allows us to distribute the computational cost between the algorithm which deals with the grammatical types and the algebraic checker which constrains the derivation.
A Labelled Analytic Theorem Proving Environment for
, 1995
"... We present a system for the investigation of computational properties of categorial grammar parsing based on a labelled analytic tableaux theorem prover. This proof method allows us to take a modular approach, in which the basic grammar can be kept constant, while a range of categorial calculi can b ..."
Abstract
 Add to MetaCart
(Show Context)
We present a system for the investigation of computational properties of categorial grammar parsing based on a labelled analytic tableaux theorem prover. This proof method allows us to take a modular approach, in which the basic grammar can be kept constant, while a range of categorial calculi can be captured by assigning different properties to the labelling algebra. The theorem proving strategy is particularly well suited to the treatment of categorial grammar, because it allows us to distribute the computational cost between the algorithm which deals with the grammatical types and the algebraic checker which constrains the derivation. 1