Categorial grammar Research Papers - Academia.edu (original) (raw)

Kayne (1994) introduced a 'Linear Correspondence Axiom' which offered for the first time a principled theory concerning the linear PF ordering of NL phrases and words. Within this theory, adjuncts constitute an anomaly,... more

Kayne (1994) introduced a 'Linear Correspondence Axiom' which offered for the first time a principled theory concerning the linear PF ordering of NL phrases and words. Within this theory, adjuncts constitute an anomaly, requiring a stipulative definition of c-command. If the category labels of Categorial Grammar are used, a simpler linearisation depending on Asymmetric Merge is obtained, which applies without stipulation to adjuncts. The linearisation makes some distinct and desirable predictions. This paper is part of a larger enterprise to develop a Minimalist version of Categorial Grammar (MCG). Here, we discuss the basis of word-order in Natural Language and propose an alternative to theories based on Kayne (1994). The new Merge-based alternative makes distinct empirical predictions, a few of which we will discuss. Our immediate purpose is to argue for a simple linearisation algorithm within the MCG we have been pursuing, but we think it could be adopted within a more ...

Η μαθηματική γλωσσολογία είναι το πεδίο των μαθηματικών, όπου μελετώνται γλωσσικά φαινόμενα και οι σχέσεις μεταξύ τους ως αντικείμενα μαθηματικών θεωριών. Στην παρούσα εργασία, παρουσιάζονται οι κατηγοριακές γραμματικές ξεκινώντας από τη... more

Η μαθηματική γλωσσολογία είναι το πεδίο των μαθηματικών, όπου μελετώνται γλωσσικά φαινόμενα και οι σχέσεις μεταξύ τους ως αντικείμενα μαθηματικών θεωριών. Στην παρούσα εργασία, παρουσιάζονται οι κατηγοριακές γραμματικές ξεκινώντας από τη Θεωρία Κατηγοριών. Αρχικά, αναπτύσσουμε τις βασικές έννοιες της Θεωρίας Κατηγοριών, όπως αυτές της κατηγορίας, του συναρτητή και του φυσικού μετασχηματισμού. Έπειτα, εισερχόμαστε στον κόσμο των κατηγοριακών γραμματικών και, πιο συγκεκριμένα, παρουσιάζουμε τη γραμματική του Αϊντουκιέβιτς, τη γραμματική Αϊντουκιέβιτς-Μπαρ-Χιλλέλ (AB), τόσο το προσεταιριστικό όσο και το μη προσεταιριστικό Λογισμό Λάμπεκ (L και NL) και το Λογισμό Λάμπεκ- Φαν Μπένθεμ (LP). Αναφέρουμε επίσης και τη δύναμη των κατηγοριακών γραμματικών εξετάζοντας τη σχέση τους με τις ασυμφραστικές γραμματικές.
Στη συνέχεια, διατυπώνονται οι κατηγοριακές γραμματικές στο πλαίσιο της γραμμικής λογικής και οδηγούμαστε στα δίκτυα αποδείξεων. Τέλος, αφιερώνεται ένα κεφάλαιο αποκλειστικά στην εφαρμογή των κατηγοριακών γραμματικών στην ελληνική γλώσσα. Κύριος στόχος της εργασίας είναι η κατάδειξη της ευδοκίμησης των κατηγοριακών γραμματικών στην ελληνική.

Lecture notes from Husserl's logic lectures published during the last 20 years offer a much better insight into his doctrine of the forms of meaning than does the fourth Logical Investigation or any other work published during Husserl's... more

Lecture notes from Husserl's logic lectures published during the last 20 years offer a much better insight into his doctrine of the forms of meaning than does the fourth Logical Investigation or any other work published during Husserl's lifetime. This paper provides a detailed reconstruction, based on all the sources now available, of Husserl's system of logical grammar. After having explained the notion of meaning that Husserl assumes in his later logic lectures as well as the notion of form of meaning as it features in 'doctrine of the forms of meaning', I present a system of rules that describes all the various forms of meaning that Husserl singles out in his lectures. The paper is accepted for publication in History and Philosophy of Logic.

This paper aims to provide a logical background for Combinatory Categorial Grammar (CCG) and its typological discussions. Based on the Curry-Howard correspondence between Gentzen-style proof systems and Lambek Lamda Calculi, and those... more

This paper aims to provide a logical background for Combinatory Categorial Grammar (CCG) and its typological discussions. Based on the Curry-Howard correspondence between Gentzen-style proof systems and Lambek Lamda Calculi, and those between Hilbert-style proof systems and substructural BCWK-logic, I define a new class of logic which provides subclasses for each of the substructural combinatory logics, called Subdirectional Combinatory Logic, and propose that CCG is a subdirectional logic of a relevance logic (Combinatory Hypothesis). This hypothesis allows us to discuss typological parameters in universal grammar in terms of the presence/absence of a certain directional combinators.

We analyze both pre- and post-verbal clitics in Italian in the context of infinitival phrases and declarative sentences, using a new form of categorial grammar in which one assigns to each morpheme a type, an element of the free... more

We analyze both pre- and post-verbal clitics in Italian in the context of infinitival phrases and declarative sentences, using a new form of categorial grammar in which one assigns to each morpheme a type, an element of the free "pregroup" generated by a partially ordered set of basic types.

We present a type theoretic analysis of Latin grammar, which pays as much attention to inflectional morphology as to syntax. We assign different types to the finite forms of Latin verbs as well as to their infinitives. The rich... more

We present a type theoretic analysis of Latin grammar, which
pays as much attention to inflectional morphology as to syntax. We assign different types to the finite forms of Latin verbs as well as to their infinitives.
The rich repertory of agreement information exhibited by Latin is accounted for by a system of numerical indexes (superscripts and subscripts) attached to the types. Agreement coherence and control of sentencehood for strings of words is to be guaranteed by calculations performed on the corresponding strings of types, in accordance with the "pregroup" grammar developed as a refinement of classical bilinear logic.

Spanish auxiliary sequences as in 'Juan puede haber tenido que estar empezando a trabajar hasta tarde' 'Juan may have had to be starting to work until late', traditionally termed auxiliary chains, have two properties that are not... more

Spanish auxiliary sequences as in 'Juan puede haber tenido que estar empezando a trabajar hasta tarde' 'Juan may have had to be starting to work until late', traditionally termed auxiliary chains, have two properties that are not naturally captured in phrasestructure approaches to syntax: (i) they follow no a priori fixed order; auxiliary permutations have different meanings, none of which is any more basic than any other (cf. 'Juan puede estar trabajando' 'Juan may be working' and 'Juan está pudiendo trabajar' 'Juan is currently able to work'); and (ii) the syntactic and semantic relations established within a chain go beyond strict monotonicity or cumulative influence; rather, they present different kinds of syntactic relations in distinct local domains. We show that an alternative to syntax grounded in a modification of the categorial grammar introduced in Ajdukiewicz (1935) that closely follows Montague (1973), Dowty (1978, 1979, 2003), and Schmerling (1983a, b, 2019) provides effective tools for subsuming Spanish auxiliary chains in an explicit and explanatory grammar.

History of Linguistics 1996, D. Cram, A. Linn and E . Nowak (eds.), vol. 2, From Classical to Contemporary Linguistics, 1999, Amsterdam / Philadelphia: John Benjamins, pp. 321-329.

In (Kanazawa, 1998) it was shown that rigid Classical Categorial Grammars are learnable (in the sense of (Gold, 1967)) from strings. Surprisingly there are recent negative results for, among others, rigid associative Lamb ek (L) grammars.... more

In (Kanazawa, 1998) it was shown that rigid Classical Categorial Grammars are learnable (in the sense of (Gold, 1967)) from strings. Surprisingly there are recent negative results for, among others, rigid associative Lamb ek (L) grammars. In this paper the non-lcarnability of the class of rigid grammars in LP (Associative-Commutative Lambek calculus) and LP0 (same, but allowing the empty sequent in derivations) will be shown. 1

Quantifier domain restriction (QDR) and two versions of nominal restriction (NR) are implemented as restrictions that depend on a previously introduced interpreter and interpretation time in a two-dimensional semantic framework on the... more

Quantifier domain restriction (QDR) and two versions of nominal restriction (NR) are implemented as restrictions that depend on a previously introduced interpreter and interpretation time in a two-dimensional semantic framework on the basis of simple type theory and categorial grammar. Against Stanley (2002) it is argued that a suitable version of QDR can deal with superlatives like tallest. However, it is shown that NR is needed to account for utterances when the speaker intends to convey different restrictions for multiple uses of the same quantifying determiner. We argue that NR generally fares better with such examples but also observe that examples like Every sailor waves at every sailor might be pragmatically anomalous. An account of contextual domain restriction is proposed that (i) excludes these anomalous readings (but it is shown how they could be included), (ii) makes it possible to express different contextual domain restrictions as long-range dependencies on an interpreter and an interpretation time, and (iii) additionally models restrictions based on locative constructions as general mereological constraints introduced by shifting the index.

We give a type logical categorial grammar for the syntax and semantics of Montague’s seminal fragment, which includes ambiguities of quantification and intensionality and their interactions, and we present the analyses assigned by a... more

We give a type logical categorial grammar for the syntax and semantics of Montague’s seminal fragment, which includes ambiguities of quantification and intensionality and their interactions, and we present the analyses assigned by a parser/theorem prover CatLog to the examples of the first half of Chapter 7 of the classic text Introduction to Montague Semantics

This dissertation explores the semantics of questions, with a focus on phenomena that challenge the standard views of the related core issues, as well as those that are technically difficult to capture under standard compositional... more

This dissertation explores the semantics of questions, with a focus on phenomena that challenge the standard views of the related core issues, as well as those that are technically difficult to capture under standard compositional semantics. It begins by re-examining several fundamental issues, such as what a question denotes, how a question is composed, and what a wh-item denotes. It then tackles questions with complex structures, including mention-some questions, multi-wh questions, and questions with quantifiers. It also explores several popular issues, such as variations of exhaustivity, sensitivity to false answers, and quantificational variability effects.

Langages, 2002, n° 148, pp. 28-50.

Foi-se há muito o tempo em que os projetos de Tecnologia da Informação restringiam-se ao âmbito doméstico. O intuito deste estudo é identificar a diferenciação das categorias de riscos entre projetos globais e domésticos. O caráter da... more

Foi-se há muito o tempo em que os projetos de Tecnologia da Informação
restringiam-se ao âmbito doméstico. O intuito deste estudo é identificar a diferenciação das
categorias de riscos entre projetos globais e domésticos. O caráter da pesquisa foi exploratório
realizado por meio de uma revisão sistemática da literatura: 503 riscos identificados em 16
artigos foram classificados em 23 categorias. Foi detectado que a principal diferença entre as
categoria de cada tipo de projeto refere-se às características de distância psíquica, categoria
exclusiva dos projetos globais. Ademais, a distância psíquica também impactou outras
categorias nos projetos globais.

The aim of the present contribution is to define how can verb particle constructions in both satellite-framed languages like Germanic, Ancient Greek or Latin and verb-framed languages like Romance (Talmy, 2000) be analyzed in a unified... more

The aim of the present contribution is to define how can verb particle constructions in both satellite-framed languages like Germanic, Ancient Greek or Latin and verb-framed languages like Romance (Talmy, 2000) be analyzed in a unified semantic model, which is compatible with the framework of Combinatory Categorial Grammar (CCG: Steedman, 2000; Baldridge and Hoyt, 2015). It is argued that the syntactic-semantic type postulated for local adjuncts as well as the type of semantic modification rule applied to compose such structures can predict not only the combinatorial distribution of motion verbs in Germanic, as opposed to Romance, but also the behaviour of cross-categorial domains like indirect/direct causation, subordination and secondary predication among several lexical classes. Finally, it is explained how it is possible for Romance to assume the syntactic expression of satellite structures, even if this language family does not belong to the satellite-framed typology.

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... more

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 the logical rules for a customized slash type-constructor.

This paper aims to show that a new pattern of non-canonical coordination (NCC), going under the rubric Right-Node Wrapping (RNW), follows naturally from independently motivated accounts of coordination and discontinuous constituency. The... more

This paper aims to show that a new pattern of non-canonical coordination (NCC), going under the rubric Right-Node Wrapping (RNW), follows naturally from independently motivated accounts of coordination and discontinuous constituency. The analysis is seated in a combinatory variant of Categorial Grammar (CG) which licenses discontinuous constituency in a highly constrained way that nonetheless describes a broad range of phenomena. It also demonstrates that the coordination data captured by Dowty's (1988) continuous combinatory CG can be accounted for straightforwardly in the present system with minor extensions. The central claim then is that these independent accounts together predict nearly the full range of observed RNW data, including some previously unknown variants of the phenomenon. In RNW coordinations , the pivot expression shared by the conjuncts is followed by some additional expression interpreted as part of the rightmost conjunct alone (Wilder, 1999; Whit-man, 2009). Due to empirical similarities between RNW and NCC, any adequate account of NCC should naturally predict RNW. However, previous like-category coordination analyses of NCC in CG can only generate peripheral pivots, thereby failing on RNW. The proposal succeeds in this respect by assigning the right conjunct discontin-uous constituency. The present formulation of discontinuity is compared favorably to existing discontinuity-based analyses of RNW in multimodal Type Logical Grammar (TLG) (Whitman, 2009; Kubota, 2014, Ms.) and Linearization Based HPSG (Chaves, 2014). Finally, it is argued that the variety of discontinuity found in RNW cannot be subsumed under more general notions of discontinuity in TLG (e.g. Kubota and Levine, forthcoming; Morrill and Valentín, 2012).

This book is a study in the foundations of model-theoretic semantics. The central thesis is that one does not need to assume a perfect structural fit between languages and their models in order to characterize the basic semantic notions.... more

This book is a study in the foundations of model-theoretic semantics. The central thesis is that one does not need to assume a perfect structural fit between languages and their models in order to characterize the basic semantic notions. In particular, truth-value gaps and gluts can be explained away as local phenomena that do not bring logical disaster in their wake. The account is based on a generalization of supervaluationary techniques and is illustrated with reference to a range of different sorts of examples, from sentential logic to type theory.

The parsing algorithm for pregroup grammars presented here exploits regularities of types of a pregroup grammar. Sufficient conditions are given for the algorithm to be linear and complete. Its working is illustrated by a grammar which... more

The parsing algorithm for pregroup grammars presented here exploits regularities of types of a pregroup grammar. Sufficient conditions are given for the algorithm to be linear and complete. Its working is illustrated by a grammar which handles unbounded dependencies and agreement with clitics in French. The grammar includes control of the complement of the infinitive by modal and causal verbs.

In glue logic (Dalrymple 1999, 2001, Asudeh 2004), LFG has found a reasonably stable but developing method for connecting syntactic structures to formal semantic intepretation. However current formulations of glue logic make the rather... more

In glue logic (Dalrymple 1999, 2001, Asudeh 2004), LFG has found a reasonably stable but developing method for connecting syntactic structures to formal semantic intepretation. However current formulations of glue logic make the rather unsatisfactory move of divorcing grammatical features from any intrinsic connection with what are usually regarded as their meanings. Rather than directly connecting a grammatical feature attribute-value combination such as [NUM PL] to a meaning-constructor that produces a plurality ...