5 search results - page 1 / 1 » Extending Lambek Grammars: a Logical Account of Minimalist G... |
ACL
2001
13 years 6 months ago
2001
We provide a logical definition of Minimalist grammars, that are Stabler's formalization of Chomsky's minimalist program. Our logical definition leads to a neat relation...
GRAMMARS
2000
13 years 4 months ago
2000
Inthis paper, we aim at giving alogical account of the representationalist view on minimalist grammars by refering to the notion of Proof-Net in Linear Logic. We propose at the sam...
ICGI
1998
Springer
13 years 9 months ago
1998
Springer
In this paper, we propose a new framework for the computational learning of formal grammars with positive data. In this model, both syntactic and semantic information are taken int...
LACL
1998
Springer
13 years 9 months ago
1998
Springer
Abstract. The paper proposes a type logical reformulation of Jacobson's ([9]) treatment of anaphoric dependencies in Categorial Grammar. To this end, the associative Lambek Ca...
ICLP
1990
Springer
13 years 9 months ago
1990
Springer
Definite Clause Grammars (DCGs) have proved valuable to computational linguists since they can be used to specify phrase structured grammars. It is well known how to encode DCGs i...