Results 1 to 10 of about 3,081 (252)
Logical Foundations for Hybrid Type-Logical Grammars [PDF]
This paper explores proof-theoretic aspects of hybrid type-logical grammars , a logic combining Lambek grammars with lambda grammars. We prove some basic properties of the calculus, such as normalisation and the subformula property and also present both a sequent and a proof net calculus for hybrid type-logical grammars.
Richard Moot, Moot Richard
exaly +4 more sources
Proof-Theoretic Aspects of Hybrid Type-Logical Grammars [PDF]
This paper explores proof-theoretic aspects of hybrid type-logical grammars, a logic combining Lambek grammars with lambda grammars. We prove some basic properties of the calculus, such as normalisation and the subformula property and also present a proof net calculus for hybrid type-logical grammars.
Richard Moot, Moot Richard
exaly +5 more sources
Learnability of type-logical grammars
AbstractA procedure for learning a lexical assignment together with a system of syntactic and semantic categories given a fixed type-logical grammar is briefly described. The logic underlying the grammar can be any cut-free decidable modally enriched extension of the Lambek calculus, but the correspondence between syntactic and semantic categories must
Sean A Fülöp
exaly +3 more sources
Combining logical and distributional methods in type-logical grammars
We propose a low-level way of combining distributional and logical ideas into a single formal system. This will be an instantiation of a more general system, adding weights to proof rules. These weights will not measure some sort of "confidence the proof
Richard Moot
doaj +4 more sources
A type-logical treebank for French
The goal of the current paper is to describe the TLGbank, a treebank of type-logical proof semi-automatically extracted from the French Treebank. Though the framework chosen for the treebank are multimodal type-logical grammars, we have ensured that the ...
Richard Moot
doaj +3 more sources
Switch graphs for parsing type logical grammars [PDF]
Parsing in type logical grammars amounts to theorem proving in a substructural logic. This paper takes the proof net presentation of Lambek's associative calculus as a case study. It introduces switch graphs for online maintenance of the Danos-Regnier acyclicity condition on proof nets.
Glyn Morrill
exaly +3 more sources
Semantic Syntax (SeSyn), originally called Generative Semantics, is an offshoot of Chomskyan generative grammar (ChoGG), rejected by Chomsky and his school in the late 1960s.
Pieter Seuren
doaj +1 more source
GF + MMT = GLF – From Language to Semantics through LF [PDF]
These days, vast amounts of knowledge are available online, most of it in written form. Search engines help us access this knowledge, but aggregating, relating and reasoning with it is still a predominantly human effort.
Michael Kohlhase, Jan Frederik Schaefer
doaj +1 more source
Quantification in frame semantics with binders and nominals of hybrid logic
This paper aims to integrate logical operators into frame-based semantics. Frames are semantic graphs that allow lexical meaning to be captured in a fine-grained way but that do not come with a natural way to integrate logical operators such as ...
Laura Kallmeyer +2 more
doaj +1 more source
Overtly Anaphoric Control in Type Logical Grammar [PDF]
In this paper we analyse anaphoric pronouns in control sentences and we investigate the implications of these kinds of sentences in relation to the Propositional Theory versus Property Theory question. For these purposes, we invoke the categorial calculus with limited contraction, a conservative extension of Lambek calculus that builds contraction into
Corbalán, María Inés, Morrill, Glyn
openaire +2 more sources

