Combinatory Linguistics

Combinatory Linguistics

by Cem Bozsahin

Hardcover

$168.00
Choose Expedited Shipping at checkout for guaranteed delivery by Thursday, April 25

Product Details

ISBN-13: 9783110251708
Publisher: De Gruyter
Publication date: 01/01/2013
Pages: 298
Product dimensions: 6.10(w) x 9.06(h) x 0.04(d)
Age Range: 18 Years

About the Author

Cem Bozşahin, Middle East Technical University, Ankara, Turkey.

Table of Contents

List of Tables xvii

1 Introduction 1

2 Order as constituent constructor 9

1 Combinatory syntactic types 9

2 Directionality in grammar: morphology, phonology or syntax? 11

3 Trees and algorithms 13

4 CCG's narrow claims in brief 16

5 Type-dependence versus structure-dependence 17

6 Constituency 22

3 The lexicon, argumenthood and combinators 31

1 Adjacency and arity 32

2 Words, supercombinators and subcombinators 33

3 Infinitude and learnability-in-principle 36

4 Syntacticizing the combinators 43

1 Unary combinators 45

2 Binary combinators 47

3 Ternary combinators 49

4 Quaternary combinators 52

5 Powers and combinations 55

6 Why syntacticize? 58

5 Combinatory Categorial Grammar 61

1 Combinators and wrapping 61

2 Linguistic categories 65

3 CCG is nearly context-free 73

4 Invariants of natural language combination 74

5 The BTS system 82

6 The LF debate 87

1 Steedman's LF 89

2 Szabolcsi's reflexives 92

3 Jacobson's pronouns 94

4 More on LF: Unary BCWZ, constituency and coordination 100

7 Further constraints on possible grammars 107

8 A BTSO system 113

9 The semantic radar 121

1 Boundedness and unboundedness 122

2 Recursive thoughts and recursive expressions 132

3 Grammar, lexicon and the interfaces 137

4 Making CCG's way through the Dutch impersonal passive 142

5 Computationalism and language acquisition 149

6 Stumbling on to knowledge of words 156

7 Functional categories 163

8 Case, agreement and expletives 170

9 The semantics of scrambling 173

10 Searle and semantics 177

10 Monadic computation by CCG 183

1 Application 184

2 Dependency 190

3 Sequencers 192

4 The CCG monad 194

5 Radical lexicalization revisited 198

6 Monadic results and CCG 200

11 Conclusion 205

Appendices 215

Appendix A Lambda calculus 217

Appendix B Combinators 219

Appendix C Variable elimination 223

Appendix D Theory of computing 225

Appendix E Radical lexicalization and syntactic types 229

Appendix F Dependency structures 233

Notes 235

Bibliography 249

Author and name index 272

Subject index 278

Customer Reviews

Most Helpful Customer Reviews

See All Customer Reviews