Combinatory Linguistics

Abstract

Preface xi embarrassed I am getting away with an acknowledgment. Before then I was fortunate to be taught by great teachers, whom I'm honored to list in somewhat chronological order: Türkân Barkın, Metin Ünver,İbrahim Nişancı, late Esen Özkarahan, Nicholas Findler and Leonard 'Aryeh' Faltz. Some friends and family taught me more on academic affairs than I was able to acknowledge so far. There is a bit of them in the book but I cannot exactly point where. Thank you Canuş, née

Paracompositionality, MWEs and Argument Substitution

“…This means that, since singletons are arguments, meaning they bear a slash, say '|A' for some slash '|' in {\, /}, the slash is inherently application-only, equivalently '| ⋆ A' in [3] terminology. 5 This is corroborated by examples like below where there is no idiomatic reading: (We show the derivation for the hypothetical case where singletons would be allowed 4 We show only one directional variant of each rule for brevity. The same idea applies to all variants; see Steedman references for a standard set of rules, and [5] for review of proposals for combinatory extensions.…”

“…5 This is corroborated by examples like below where there is no idiomatic reading: (We show the derivation for the hypothetical case where singletons would be allowed 4 We show only one directional variant of each rule for brevity. The same idea applies to all variants; see Steedman references for a standard set of rules, and [5] for review of proposals for combinatory extensions. Bozşahin [5]: §10 shows that all projection rules of CCG can be packed into one monad to enable monadic computation with just one rule of projection.…”

“…The same idea applies to all variants; see Steedman references for a standard set of rules, and [5] for review of proposals for combinatory extensions. Bozşahin [5]: §10 shows that all projection rules of CCG can be packed into one monad to enable monadic computation with just one rule of projection. This is possible because CCG is radically lexicalized in the sense that combinatory rules cannot project anything which is not in the lexicon.…”

“…What appears to be rule choice when presented as (9/13) becomes dependency passing within monad with one rule of combination. 5 The way this is implemented in many CCG systems including ours is for example to constrain the slashes as follows:…”

“…Apart from our empirical claim that they have a place in LF because they relate to contingency, vacuous abstractions seem to open ways to resource insensitivity which is unheard of in natural language; for example, the K combinator with its vacuous abstraction λ xλ y.x can delete things from LF. We have yet to find a word or morpheme that does this; see[5]:81 for some speculation. [22]'s treatment of phrasal idioms such as kick the bucket assumes partial involvement of the head verb kick for the semantics of the idiom, whereas in our conception it is fully responsible for the idiom with the aid of singleton types.…”