. This paper describes a system of categorial inference based on insights from Lexicalized Tree Adjoining Grammar (LTAG). LTAG is a tree-rewriting system and therefore deals with structural, not string, adjacency. When looked at from the logic perspective, the nodes of the trees become types as in a categorial grammar, with corresponding deductive connections between parent and daughter nodes. The resulting system is based on a hybrid logic, with one logic for building Partial Proof Trees, and the other for composing the partial proofs. We reexamine the use of structural modalities in categorial grammar from this perspective, concluding that the use of structural modalities can be considerably simplified, or even eliminated in som...
The weak equivalence of Combinatory Categorial Grammar (CCG) and Tree-Adjoining Grammar (TAG) is a c...
International audienceIn this paper, we first study the connections between subclasses of AB-categor...
Constrained grammatical system have been the object of study in computational linguistics over the l...
International audienceIn this chapter, learning is viewed as a symbolic issue in an unsupervised set...
Type logical grammar presents a paradigm of linguistic description based on what we may refer to a...
This paper shows how DATR, a widely used formal language for lexical knowledge representation, can b...
We present a model of the syntax-semantics interface for Tree-Adjoining Grammars (TAGs). It is based...
This paper gives an interpretation of Combinatory Categorial Grammar derivations in terms of the con...
¤I wish to thank the participants of LFG2001, especially Mary Dalrymple and Ron Kaplan, for valuable...
Most current linguistic theories give lexical accounts of several phenomena that used to be consider...
We propose a generalization of Categorial Grammar in which lexical categories are defined by means o...
In logical categorial grammar [23,11] syntactic structures are categorial proofs and semantic struct...
The generative capacity of combinatory categorial grammars (CCGs) as generators of tree languages is...
We propose to set the grammatical inference problem in a logical framework. The search for admissibl...
Introduction Many TAG-based systems employ a particular tree adjoining grammar to generate the inte...
The weak equivalence of Combinatory Categorial Grammar (CCG) and Tree-Adjoining Grammar (TAG) is a c...
International audienceIn this paper, we first study the connections between subclasses of AB-categor...
Constrained grammatical system have been the object of study in computational linguistics over the l...
International audienceIn this chapter, learning is viewed as a symbolic issue in an unsupervised set...
Type logical grammar presents a paradigm of linguistic description based on what we may refer to a...
This paper shows how DATR, a widely used formal language for lexical knowledge representation, can b...
We present a model of the syntax-semantics interface for Tree-Adjoining Grammars (TAGs). It is based...
This paper gives an interpretation of Combinatory Categorial Grammar derivations in terms of the con...
¤I wish to thank the participants of LFG2001, especially Mary Dalrymple and Ron Kaplan, for valuable...
Most current linguistic theories give lexical accounts of several phenomena that used to be consider...
We propose a generalization of Categorial Grammar in which lexical categories are defined by means o...
In logical categorial grammar [23,11] syntactic structures are categorial proofs and semantic struct...
The generative capacity of combinatory categorial grammars (CCGs) as generators of tree languages is...
We propose to set the grammatical inference problem in a logical framework. The search for admissibl...
Introduction Many TAG-based systems employ a particular tree adjoining grammar to generate the inte...
The weak equivalence of Combinatory Categorial Grammar (CCG) and Tree-Adjoining Grammar (TAG) is a c...
International audienceIn this paper, we first study the connections between subclasses of AB-categor...
Constrained grammatical system have been the object of study in computational linguistics over the l...