Bozsahin Combinatory Linguistics
1. Auflage 2012
ISBN: 978-3-11-029687-7
Verlag: De Gruyter
Format: PDF
Kopierschutz: 1 - PDF Watermark
E-Book, Englisch, 298 Seiten
ISBN: 978-3-11-029687-7
Verlag: De Gruyter
Format: PDF
Kopierschutz: 1 - PDF Watermark
The book examines to what extent the mediating relation between constituents and their semantics can arise from combinatory knowledge of words. It traces the roots of Combinatory Categorial Grammar, and uses the theory to promote a Humean question in linguistics and cognitive science: Why do we see limited constituency and dependency in natural languages, despite their diversity and potential infinity? A potential answer is that constituents and dependencies might have arisen from a single resource: adjacency. The combinatory formulation of adjacency constrains possible grammars.
Zielgruppe
Post-Graduate Students in Linguistics, Computer Science and Cognitive Science
Autoren/Hrsg.
Fachgebiete
Weitere Infos & Material
1;List of Tables;17
2;1 Introduction1;19
3;2 Order as constituent constructor;27
3.1;1 Combinatory syntactic types;27
3.2;2 Directionality in grammar: morphology, phonology or syntax?;29
3.3;3 Trees and algorithms;31
3.4;4 CCG’s narrow claims in brief;34
3.5;5 Type-dependence versus structure-dependence;35
3.6;6 Constituency;40
4;3 The lexicon, argumenthood and combinators;49
4.1;1 Adjacency and arity;50
4.2;2 Words, supercombinators and subcombinators;51
4.3;3 Infinitude and learnability-in-principle;54
5;4 Syntacticizing the combinators;61
5.1;1 Unary combinators;63
5.2;2 Binary combinators;65
5.3;3 Ternary combinators;67
5.4;4 Quaternary combinators;70
5.5;5 Powers and combinations;73
5.6;6 Why syntacticize?;76
6;5 Combinatory Categorial Grammar;79
6.1;1 Combinators and wrapping;79
6.2;2 Linguistic categories;83
6.3;3 CCG is nearly context-free;91
6.4;4 Invariants of natural language combination;92
6.5;5 The BTS system;100
7;6 The LF debate;105
7.1;1 Steedman’s LF;107
7.2;2 Szabolcsi’s reflexives;110
7.3;3 Jacobson’s pronouns;112
7.4;4 More on LF: Unary BCWZ, constituency and coordination;118
8;7 Further constraints on possible grammars;125
9;8 A BTSO system;131
10;9 The semantic radar;139
10.1;1 Boundedness and unboundedness;140
10.2;2 Recursive thoughts and recursive expressions;150
10.3;3 Grammar, lexicon and the interfaces;155
10.4;4 Making CCG’s way through the Dutch impersonal passive;160
10.5;5 Computationalism and language acquisition;167
10.6;6 Stumbling on to knowledge of words;174
10.7;7 Functional categories;181
10.8;8 Case, agreement and expletives;188
10.9;9 The semantics of scrambling;191
10.10;10 Searle and semantics;195
11;10 Monadic computation by CCG;201
11.1;1 Application;202
11.2;2 Dependency;208
11.3;3 Sequencers;210
11.4;4 The CCG monad;212
11.5;5 Radical lexicalization revisited;216
11.6;6 Monadic results and CCG;218
12;11 Conclusion;223
13;Appendices;233
13.1;Appendix A: Lambda calculus;235
13.2;Appendix B: Combinators;237
13.3;Appendix C: Variable elimination;241
13.4;Appendix D: Theory of computing;243
13.5;Appendix E: Radical lexicalization and syntactic types;247
13.6;Appendix F: Dependency structures;251
14;Notes;253
15;Bibliography;267
15.1;Author and name index;291
15.2;Subject index;297