基本説明
Greatly advances Optimality Theory (OT) by clarifying the significant choices in the design of a formally precise OT approach to syntax. Building on OT-LFG, Kuhn defines the notion of an OT-syntactic grammar in a declarative, non-derivational way.
Full Description
With this book, Jonas Kuhn greatly advances optimality theory (OT) by clarifying the significant choices in the design of a formally precise OT approach to syntax. Building on OT work that uses the representation structures of lexical functional grammar (OT-LFG), Kuhn defines the notion of an OT-syntactic grammar in a declarative, non-derivational way. Along with the standard OT architecture, which is based on a generation metaphor, Kuhn also formalizes parsing-based OT, and goes on to discuss possible combinations of these two architectures. This is followed by an examination of assumptions under which the computational tasks of generation and parsing are decidable for an OT-syntactic grammar.
Table of Contents
Preface ix
1 Introduction 1 (4)
2 The Foundations of OT 5 (22)
2.1 Conflicting Violable Constraints 5 (6)
2.2 Factorial Typology and the Grounding of 11 (13)
Constraints
2.2.1 Factorial typology 11 (6)
2.2.2 The predictive power of factorial 17 (3)
typology
2.2.3 The grounding of constraints 20 (3)
2.2.4 Simplicity in the logical structure 23 (1)
of constraints
2.3 Summary 24 (3)
3 Observations about OT Syntax 27 (28)
3.1 On the Motivation of Syntactic OT 27 (2)
Constraints
3.2 Faithfulness violations in Phonology and 29 (9)
Syntax
3.2.1 Constraint interaction as the main 29 (2)
explanatory device
3.2.2 Epenthesis and deletion in phonology 31 (2)
3.2.3 Syntactic variation across languages 33 (4)
3.2.4 Consequences for Gen 37 (1)
3.3 Learning and the Character of the Input 38 (16)
3.3.1 Learning in OT 38 (4)
3.3.2 Criteria for 42 (3)
learnability-implications for the input
3.3.3 Language-Particular Ineffability 45 (3)
3.3.4 The problem for learnability 48 (1)
3.3.5 The non-derivational view of the 49 (5)
input-output connection
3.4 Summary 54 (1)
4 The Formalization of OT Syntax 55 (64)
4.1 Background on Lexical-Functional Grammar 56 (7)
4.2 Optimality-Theoretic LFG-the Overall 63 (11)
Architecture
4.2.1 Abstract formal specification 64 (3)
4.2.2 Degrees of freedom in this OT LFG 67 (2)
architecture
4.2.3 Undecidability arguments for 69 (3)
unrestricted OT systems
4.2.4 Fixing the choices in the definitions 72 (2)
4.3 Candidate Generation and the Inviolable 74 (7)
Principles
4.3.1 The restricted definition of 74 (1)
GenGinviol
4.3.2 Completeness and Coherence in OT 75 (2)
syntax
4.3.3 The base grammar Ginviol 77 (4)
4.4 The Violable Constraints: Markedness 81 (24)
Constraints
4.4.1 Markedness constraints in OT-LFG 81 (4)
4.4.2 Universal quantification of 85 (4)
constraints
4.4.3 Constraint schemata 89 (5)
4.4.4 Constraint schemata as standard LFG 94 (7)
descriptions
4.4.5 Digression: Constraint marking as 101(4)
description by analysis vs. codescription
4.5 Faithfulness Constraints 105(10)
4.5.1 Faithfulness and the 106(5)
subsumption-based GenGinviol
4.5.2 The formalization of faithfulness 111(4)
constraints
4.6 Summary 115(4)
5 The Direction of Optimization 119(46)
5.1 Varying the Input to Optimization 121(9)
5.1.1 Word order freezing 125(5)
5.2 The Character of Comprehension-based 130(7)
Optimization
5.2.1 Apparent counterevidence against 131(4)
constraint ranking
5.2.2 Optimization with a fixed context 135(2)
5.3 Bidirectional Optimization 137(27)
5.3.1 Sequential bidirectional optimization 138(4)
models
5.3.2 Strong bidirectional optimization 142(4)
5.3.3 Weak bidirectional optimization 146(3)
5.3.4 Deriving recoverability through 149(11)
bidirectional optimization
5.3.5 Ineffability and strong vs. weak 160(4)
bidirectionality
5.4 Summary 164(1)
6 Computational OT Syntax 165(48)
6.1 Processing Issues for OT LFG 166(8)
6.1.1 Infinite candidate sets in processing 167(3)
6.1.2 Directionality in processing 170(4)
6.2 Decidability of OT LFG Generation 174(25)
6.2.1 Generation with LFG grammars 174(13)
6.2.2 OT LFG generation 187(12)
6.3 Recognition and Parsing for OT LFG 199(13)
6.3.1 Undecidability of the unrestricted 200(2)
recognition problem
6.3.2 Decidability of variants of the 202(10)
parsing task
6.4 Summary 212(1)
7 Conclusion 213(6)
References 219(10)
Constraint Index 229(2)
Name Index 231(4)
Subject Index 235
