Interface Strategies: Optimal and Costly Computations (Paperback)
暫譯: 介面策略：最佳與成本計算
Tanya Reinhart
- 出版商: MIT
- 出版日期: 2006-03-24
- 售價: $1,580
- 貴賓價: 9.5 折 $1,501
- 語言: 英文
- 頁數: 336
- 裝訂: Paperback
- ISBN: 0262681560
- ISBN-13: 9780262681568
已絕版
商品描述
Description
In this monograph Tanya Reinhart discusses strategies enabling the interface of different cognitive systems, which she identifies as the systems of concepts, inference, context, and sound. Her point of departure is Noam Chomsky's hypothesis that language is optimally designed--namely, that in many cases, the bare minimum needed for constructing syntactic derivations is sufficient for the full needs of the interface. Deviations from this principle are viewed as imperfections.
The book covers in depth four areas of the interface: quantifier scope, focus, anaphora resolution, and implicatures. The first question in each area is what makes the computational system (CS, syntax) legible to the other systems at the interface--how much of the information needed for the interface is coded already in the CS, and how it is coded. Next Reinhart argues that in each of these areas there are certain aspects of meaning and use that cannot be coded in the CS formal language, on both conceptual and empirical grounds. This residue is governed by interface strategies that can be viewed as repair of imperfections. They require constructing and comparing a reference set of alternative derivations to determine whether a repair operation is indeed the only way to meet the interface requirements.
Evidence that reference-set computation applies in these four areas comes from language acquisition. The required computation poses a severe load on working memory. While adults can cope with this load, children, whose working memory is less developed, fail in tasks requiring this computation.
Tanya Reinhart holds the Interface Chair at Utrecht University Language Institute (OTS) and as of Fall 2006 is a Global Distinguished Professor at NYU.
Table of Contents
Acknowledgments ix
Introduction: Optimal Design
1 Reference-Set Computation
1.1 The Minimal Link Condition 14
1.2 Interpretation-Dependent Reference Sets 25
1.3 The Interface Strategy: Repair of Imperfections 37
2 Scope Shift 47
2.1 Quantifier Scope: The State of the Art 48
2.1.1 The Optimistic QR View of the 1970s 48
2.1.2 The Syntactic Freedom of Existential Wide Scope 50
2.1.3 Can the Problem with Existentials Be Explained Away? 53
2.1.4 The "Realistic" QR View of the 1980s 60
2.1.5 Some Problems 61
2.2 The Alternative of Wide Scope In Situ 64
2.2.1 Wh-In Situ 64
2.2.2 Sluicing 69
2.3 The Interpretation Problem of Wide Scope In Situ 68
2.3.1 Wh-In Situ 69
2.3.2 Sluicing 71
2.3.3 Existential Wide Scope 73
2.4 The Semantic Problem with Island-Free QR 76
2.5 An Intermediate Summary 79
2.6 Where No QR Is Needed: Choice Functions for Existential Quantifiers 81
2.6.1 Choice Functions and Existential Closure 81
2.6.2 Deriving the Choice-Function Interpretation 85
2.6.3 The Collective-Distributive Distinction 88
2.6.4 Which Indefinites Are Interpretable by Choice Functions? 91
2.6.5 Some Choice-Functions Semantics 95
2.7 Scope-Shift: An Interface Repair Strategy 101
2.7.1 Minimize Interpretative Options 101
2.7.2 Applying the Illicit QR as a Repair Strategy 105
2.7.3 Processing Limitations on the Size of Reference Sets--Indefinite Numerals 110
3 Focus: The PF Interface 125
3.1 Sentence Main Stress 127
3.1.1 Cinque's Main-Stress System 127
3.1.2 Szendröi's Main-Stress System 131
3.2 How Focus Is Coded 134
3.2.1 Main Stress and Focus: The Basic View 134
3.2.2 PF-Coding: The Focus Set 135
3.3 Stress Operations 141
3.3.1 Focus and Anaphora 141
3.3.2 The Operations: Destressing and Main-Stress Shift 148
3.4 Reference-Set Computation 156
3.4.1 Focus Projection 156
3.4.2 Markedness 161
4 The Anaphora Reference-Set Strategy 165
4.1 Two Procedures of Anaphora Resolution 165
4.1.1 The Current Picture 166
4.1.2 What is Binding? 169
4.1.3 Covaluation 172
4.2 Anaphora Restrictions 173
4.2.1 Restrictions on Binding 173
4.2.2 Restrictions on Covaluation 178
4.3 The Interface Strategy Governing Covaluation (Rule I) 181
4.3.1 Minimize Interpretative Options 181
4.3.2 Reference-Set Computation 186
4.3.3 Further Details of the Computation 190
4.4 Covaluation in Ellipses Contexts 192
4.5 The Psychological Reality of Rule I 196
5 The Processing Cost of Reference-Set Computation 199
5.1 Acquisition of the Coreference Rule I 204
5.1.1 An Overview of Binding and Rule I 206
5.1.2 Thornton and Wexler's Arguments against the Processing Account 216
5.1.3 Questions of Learnability 227
5.1.4 Explaining Chance Performance 232
5.2 Acquisition of Main-Stress Shift 238
5.2.1 An Overview of Stress and Focus 238
5.2.2 Preliminaries 246
5.2.3 Switch-Reference Resolution 251
5.2.4 Guess and Default: Focus and Identification in the Scope of Only 259
5.2.5 Useful and Arbitrary Defaults 266
5.3 Acquisition of Scalar Implicatures 272
Notes 293
References
Author Index
Subject Index
商品描述(中文翻譯)
描述
在這本專著中，Tanya Reinhart 討論了使不同認知系統之間能夠互相介面的策略，她將這些系統定義為概念、推理、上下文和聲音的系統。她的出發點是 Noam Chomsky 的假設，即語言是最佳設計的——也就是說，在許多情況下，構建句法推導所需的最低限度已足以滿足介面的全部需求。偏離這一原則的情況被視為不完美。
這本書深入探討了介面的四個領域：量詞範圍、焦點、指代解析和隱含意。每個領域的第一個問題是什麼使計算系統（CS，句法）對介面的其他系統可讀——介面所需的信息有多少已經在 CS 中編碼，以及它是如何編碼的。接著，Reinhart 主張在這些領域中，有某些意義和用法的方面無法在 CS 的形式語言中編碼，這在概念和實證上都是成立的。這些殘餘由介面策略所支配，可以視為對不完美的修復。它們需要構建和比較一組替代推導的參考集，以確定修復操作是否確實是滿足介面要求的唯一方法。
來自語言習得的證據表明，參考集計算適用於這四個領域。所需的計算對工作記憶造成了嚴重負擔。雖然成年人能夠應對這一負擔，但工作記憶發展較差的兒童在需要這一計算的任務中失敗。
Tanya Reinhart 擔任烏特勒支大學語言研究所（OTS）的介面講座教授，自 2006 年秋季起成為紐約大學的全球傑出教授。
目錄
致謝 ix
引言：最佳設計
1 參考集計算
1.1 最小鏈條條件 14
1.2 依賴於解釋的參考集 25
1.3 介面策略：不完美的修復 37
2 範圍轉移 47
2.1 量詞範圍：當前狀況 48
2.1.1 1970 年代的樂觀 QR 觀點 48
2.1.2 存在性廣範圍的句法自由 50
2.1.3 存在性問題能否被解釋？ 53
2.1.4 1980 年代的「現實」QR 觀點 60
2.1.5 一些問題 61
2.2 寬範圍的替代方案 64
2.2.1 Wh-In Situ 64
2.2.2 Sluicing 69
2.3 寬範圍 In Situ 的解釋問題 68
2.3.1 Wh-In Situ 69
2.3.2 Sluicing 71
2.3.3 存在性廣範圍 73
2.4 無島 QR 的語義問題 76
2.5 中間總結 79
2.6 無需 QR 的地方：存在量詞的選擇函數 81
2.6.1 選擇函數和存在閉合 81
2.6.2 推導選擇函數解釋 85
2.6.3 集合-分配區別 88
2.6.4 哪些不定詞可以由選擇函數解釋？ 91
2.6.5 一些選擇函數語義 95
2.7 範圍轉移：介面修復策略 101
2.7.1 最小化解釋選項 101
2.7.2 將非法 QR 應用作修復策略 105
2.7.3 參考集大小的處理限制——不定數詞 110
3 焦點：PF 介面 125
3.1 句子的主要重音 127
3.1.1 Cinque 的主要重音系統 127
3.1.2 Szendröi 的主要重音系統 131
3.2 焦點是如何編碼的 134
3.2.1 主要重音和焦點：基本觀點 134
3.2.2 PF 編碼：焦點集 135
3.3 重音操作 141
3.3.1 焦點和指代 141
3.3.2 操作：去重音和主要重音轉移 148
3.4 參考集計算 156
3.4.1 焦點投影 156
3.4.2 標記性 161
4 指代參考集策略 165
4.1 指代解析的兩個程序 165
4.1.1 當前情況 166
4.1.2 什麼是綁定？ 169
4.1.3 共同評價 172
4.2 指代限制 173
4.2.1 綁定的限制 173
4.2.2 共同評價的限制 178
4.3 支配共同評價的介面策略（規則 I） 181
4.3.1 最小化解釋選項 181
4.3.2 參考集計算 186
4.3.3 計算的進一步細節 190
4.4 在省略語境中的共同評價 192
4.5 規則 I 的心理現實 196
5 參考集計算的處理成本 199
5.1 共同參考規則 I 的習得 204
5.1.1 綁定和規則 I 的概述 206
5.1.2 Thornton 和 Wexler 反對處理賬戶的論點 216
5.1.3 可學習性的問題 227
5.1.4 解釋偶然表現 232
5.2 主要重音轉移的習得 238
5.2.1 重音和焦點的概述 238
5.2.2 初步準備 246
5.2.3 轉換參考解析 251
5.2.4 猜測和默認：在 Only 的範圍內的焦點和識別 259
5.2.5 有用和任意的默認 266
5.3 標量隱含意的習得 272
註釋 293
參考文獻
作者索引
主題索引
