Combinatory Categorial Grammar Research Papers (original) (raw)

Meaning structures generated by a heavily morphological language such as Turkish cannot be represented without a morphological analysis. Accounting for syntax and semantics jointly is a natural way to attempt an investigation in this... more

Meaning structures generated by a heavily morphological language such as Turkish cannot be represented without a morphological analysis. Accounting for syntax and semantics jointly is a natural way to attempt an investigation in this area. Combinatory Categorial Grammar (CCG) offers an efficient framework for such an investigation. The aim of this study is to build a CCG for Turkish finite verb inflectional suffixes, which exhibit complex information content on both syntactic and semantic layers. For the sake of completeness, several composite non-finite verb inflectional suffixes are also considered. Grammar rules for suffixes are designed and tuned for compatibility in complex compositions. Several sets of features are implemented to prevent disallowed permutations from forming. The accuracy of the resulting grammar is demonstrated with tests on numerous complex sentences.

This thesis aims at investigating the grammatical relations in Turkish Sign Language (TID). For this aim, word order, nominal morphology, and agreement morphology of verbs are examined. TID lacks morphological case, but it has a very rich... more

This thesis aims at investigating the grammatical relations in Turkish Sign Language (TID). For this aim, word order, nominal morphology, and agreement morphology of verbs are examined. TID lacks morphological case, but it has a very rich pronominal system like other sign languages. Verbs are classified according to their morphosyntactic features. With this classification, we can observe the effect of word order and agreement morphology on the grammatical relations.
Combinatory Categorial Grammar as a lexicalized grammar encodes word order, morphological case, and agreement features in the lexicon. Hence, it has the tools for testing any lexicalized basic word order hypothesis for a language based on the gapping data. Gapping data based on grammatical judgments of native signers indicate that TID is a verb final language.
Syntactic ergativity seems to be prevailing in coordination of a transitive sentence and an intransitive sentence where the single argument of the intransitive clause or one of the arguments of the transitive clause is missing. T˙ID also shows a tendency
for ergativity in lexical properties such as agreement and pro-drop.

This paper explores the linguistic implications of Non-commutative Linear Logic, with particular reference to its multiplicative fragment MNLL, that exhibits a direct relationship to Lambek’s Syntactic Calculus. Such a framework is... more

This paper explores the linguistic implications of Non-commutative Linear Logic, with particular reference to its multiplicative fragment MNLL, that exhibits a direct relationship to Lambek’s Syntactic Calculus. Such a framework is appealing for linguistic analysis since it allows one to develop a dynamic characterization of the notion of a function, that plays a basic role in the foundations of categorial grammar. The analysis will focus on a variety of constructions involving scope configurations, unbounded dependencies and Wh-clauses. Particular attention is given to the proof nets for MNLL, that are planar graphs in which the communication processes and the flow of information are represented by means of a parallelistic architecture. We will introduce proof nets and sequent derivations associated to each linguistic expression and will show that a direct relationship exists between the types and derivations of the Syntactic Calculus and the corresponding types and derivations in MNLL. Moreover, given the symmetric architecture and the crucial role played by the two negations of Non-commutative Linear Logic in the generation of the logical types, we will show that this system is richer in expressive power and in the capacity of performing left-to-right computations of word strings.

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.

This paper describes a computational framework for a grammar architecture in which different linguistic domains such as morphology, syntax, and semantics are treated not as separate components but compositional domains. Word and phrase... more

This paper describes a computational framework for a grammar architecture in which different linguistic domains such as morphology, syntax, and semantics are treated not as separate components but compositional domains. Word and phrase formation are modeled as uniform processes contributing to the derivation of the semantic form. The morpheme, as well as the lexeme, has lexical representation in the form of semantic content, tactical constraints, and phonological realization. The motivation for this work is to handle morphology-syntax interaction (e.g., valency change in causatives, subcategorization imposed by case-marking affixes) in an incremental way. The model is based on Combinatory Categorial Grammars.

This study focuses on one of the controversial topics of sign and spoken language linguistics, the interaction between syntax and phonology. In sign language literature, Neidle et al. (2000) argue that non-manual markings are syntactic... more

This study focuses on one of the controversial topics of sign and spoken language linguistics, the interaction between syntax and phonology. In sign language literature, Neidle et al. (2000) argue that non-manual markings are syntactic markers driven completely by the syntax. On the other side, Nespor and Sandler (1990), Sandler and Lillo-Martin (2006) claim that prosody is a separate component of the grammar and independent of other components, on the grounds of their observations that there is a non-isomorphism between the prosodic and syntactic constituents. This study analyzes the so-called non-isomorphism examples in Nespor and Sandler (1990), Sandler and Lillo-Martin (2006) within the theory of Combinatory Categorial Grammar (Steedman 2000a, 2000b) which is an integrated lexicalized theory of syntax, semantics and prosody. In this theory, the interaction of syntax, semantics and phonology is determined by the lexicon.
Intonational and surface structures are the aspects of the same derivational structure, and same type-driven combinatory rules apply to both. This analysis shows that when parsing with Combinatory Categorial Grammar (CCG), non-isomorphism does not occur due to the fact that CCG relies on coordination for constituency. In other words, CCG has a syntactic boundary whenever there is a intonational boundary. Hence, it has syntactic constituents which are consistent with the phonologists’ observations.

This dissertation presents the development of a wide-coverage semantic parser capable of handling quantifier scope ambiguities in a novel way. In contrast with traditional approaches that deliver an underspecified representation and focus... more

This dissertation presents the development of a wide-coverage semantic parser capable of handling quantifier scope ambiguities in a novel way. In contrast with traditional approaches that deliver an underspecified representation and focus on enumerating the possible readings “offline” after the end of the syntactic analysis, our parser handles the ambiguities during the derivation using a semantic device known as generalized skolem term. This approach combines most of the benefits of the existing methods and provides solutions to their deficiencies with a natural way. Furthermore, this takes place in the context of the grammar itself, without resorting to ad-hoc complex mechanisms.

The flight of a bird is not in wings, but in the shape of the space-time enclosed by each wing from instant to instant. In other words, flight is a grammar of relationships. An infinite variety and number of wings may participate in this... more

The flight of a bird is not in wings, but in the shape of the space-time enclosed by each wing from instant to instant. In other words, flight is a grammar of relationships. An infinite variety and number of wings may participate in this grammar of flight relationships, but it is the grammar alone which remains constant.

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.

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

A preliminary implementation of AraMWE, a hybrid project that includes a statistical component and a CCG symbolic component to extract and treat MWEs and idioms in Arabic and English parallel texts is presented, together with a... more

A preliminary implementation of AraMWE, a
hybrid project that includes a statistical component
and a CCG symbolic component to extract
and treat MWEs and idioms in Arabic and English
parallel texts is presented, together with a
general sketch of the system, a thorough description
of the statistical component and a proof of
concept of the CCG component.

The needs of command and control (C2) dominate the requirements on data fusion technology. We analyze cognitive and technical models of data fusion and C2 and propose a new functional model that unifies and extends the JDL fusion model... more

The needs of command and control (C2) dominate the requirements on data fusion technology. We analyze cognitive and technical models of data fusion and C2 and propose a new functional model that unifies and extends the JDL fusion model and Bryant's CECA cognitive model. This model clarifies the requirement for human-controllable coherent inferencing of situation and course of action, both retrospectively and predictively. It in turn motivates a common representation for situations, threats, impacts and courses of action. We show that the situation tree formalism has the required representational capacity. We define its semantics, establish its decidability and soundness and show how it can be applied to land and air scenarios (the Battle of Alamein and a combat air patrol). A situation tree can be extracted from a sequence-set combinatory categorial grammar (SSCCG) tree, which can be estimated from sensor data. A fast agenda-based parsing algorithm is presented. Results show th...

This paper presents a new algorithm for plan recognition called ELEXIR (Engine for LEXicalized Intent Recognition). ELEXIR represents the plans to be recognized with a grammatical formalism called Combinatory Categorial Grammar(CCG). We... more

This paper presents a new algorithm for plan recognition called ELEXIR (Engine for LEXicalized Intent Recognition). ELEXIR represents the plans to be recognized with a grammatical formalism called Combinatory Categorial Grammar(CCG). We show that representing plans with CCGs can allow us to prevent early commitment to plan goals and thereby reduce runtime.

The definition of combinatory categorial grammar (CCG) in the literature varies quite a bit from author to author. However, the differences between the definitions are important in terms of the language classes of each CCG. We prove that... more

The definition of combinatory categorial grammar (CCG) in the literature varies quite a bit from author to author. However, the differences between the definitions are important in terms of the language classes of each CCG. We prove that a wide range of CCGs are strongly context-free, including the CCG of CCG-bank and of the parser of Clark and Curran (2007). In light of these new results, we train the PCFG parser of Petrov and Klein (2007) on CCGbank and achieve state of the art results in supertagging accuracy, PARSEVAL measures and dependency accuracy.

This paper discusses interactions between negative concord and restructuring/clause union in Palestinian Arabic. Analyses formulated in Tree Adjoining Grammar and Combinatorial Categorial Grammar are compared, with the conclusion that a... more

This paper discusses interactions between negative concord and restructuring/clause union in Palestinian Arabic. Analyses formulated in Tree Adjoining Grammar and Combinatorial Categorial Grammar are compared, with the conclusion that a perspicuous analysis of the the intricacies of the data requires aspects of both formalisms; in particular, the TAG notion of the extended domain of locality and the CCG notion of flexible constituency.

In this paper, we present a Combinatory Categorial Grammar (CCG) based approach to the classification of emotion in microtext. We develop a method that makes use of the notion put forward by Ortony, Clore, and Collins (1988), that... more

In this paper, we present a Combinatory Categorial Grammar (CCG) based approach to the classification of emotion in microtext. We develop a method that makes use of the notion put forward by Ortony, Clore, and Collins (1988), that emotions are valenced reactions. This hypothesis sits central to our system, in which we adapt contextual valence shifters to infer the emotional content of a text. We integrate this with an augmented version of WordNet-Affect, which acts as our lexicon. Finally, we experiment with a corpus of headlines proposed in the 2007 SemEval Affective Task (Strapparava and Mihalcea 2007) as our microtext corpus, and by taking the other competing systems as a baseline, demonstrate that our approach to emotion categorisation performs favourably.

This paper explores the linguistic implications of Non-commutative Linear Logic, with particular reference to its multiplicative fragment MNLL, that exhibits a direct relationship to Lambek's Syntactic Calculus. Such a framework is... more

This paper explores the linguistic implications of Non-commutative Linear Logic, with particular reference to its multiplicative fragment MNLL, that exhibits a direct relationship to Lambek's Syntactic Calculus. Such a framework is appealing for linguistic analysis since it allows one to develop a dynamic characterization of the notion of a function, that plays a basic role in the foundations of categorial

Until quite recently, extending Phrase-based Statistical Machine Translation (PBSMT) with syntactic structure caused system per- formance to deteriorate. In this work we show that incorporating lexical syntactic de- scriptions in the form... more

Until quite recently, extending Phrase-based Statistical Machine Translation (PBSMT) with syntactic structure caused system per- formance to deteriorate. In this work we show that incorporating lexical syntactic de- scriptions in the form of supertags can yield significantly better PBSMT systems. We de- scribe a novel PBSMT model that integrates supertags into the target language model and the target side of