When is less more? Faithfulness and minimal links in wh-chains
Published 1 January 1998Open access
Géraldine Légendre, Paul Smolensky, Colin Wilson
Citations88
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
Abstract
In the domain of wh-questions, we explore the application of OT to syntactic explanation based on the principle of Minimal Links ('Shortest Move'). We develop a family of constraints called MinLink, and argue: (a) OT allows a strong but flexible MinLink to be constructed directly from general principles, and (b) the resulting MinLink explains a broad range of cross-linguistic (overt and covert) extraction facts. In addition, we argue for certain general solutions to fundamental questions for comparison-based syntactic formalisms: What structures compete? What is the 'input'? How is language-particular ineffability possible? How are marked outputs possible?
Keywords
Computer Science
MPG.PuRe (Max Planck Society)Logical Relations in Chinese and the Theory of Grammar
2,126 Citations1998Cheng-Teh James Huang
Thesis (Ph.D.)--Massachusetts Institute of Technology, Dept. of Linguistics and Philosophy, 1982.
Studies in natural language and linguistic theoryOn the Nature of Proper Government
758 Citations1990Howard Lasnik, Mamoru Saitō
Types of Ā-dependencies
670 Citations1990Guglielmo Cinque
Types of A'-Dependencies develops the theories of Bonding and Government of the "principles and parameters" approach to syntax pioneered by Noam Chomsky using data from Romance languages to argue for a particular way of delimiting the descriptive generalizations of constituent extraction.
Natural Language & Linguistic TheoryOn multiple questions and multiple WH fronting
571 Citations1988Catherine Rudin
Natural Language & Linguistic TheorySpec of IP and spec of VP: Two subjects in Austronesian languages
549 Citations1992Eithne Guilfoyle, Henrietta Hung +1 more
It is claimed that certain facts from four Austronesian languages provide striking support for the claim that there is a VP-internal subject position in addition to the traditional subject position of SPEC of IP.
DSpace@MIT (Massachusetts Institute of Technology)The A/A-bar distinction and movement theory
428 Citations2008Anoop Mahajan
Proceedings of the Annual Meeting of the Berkeley Linguistics SocietyAn Optimality-Theoretic Typology of Case and Grammatical Voice Systems
174 Citations1993Géraldine Légendre, William D. Raymond +1 more
Natural Language & Linguistic TheoryOn nominal islands and LF extraction in Chinese
150 Citations1994Wei-Tien Dylan Tsai
This paper proposes to deal with the LF asymmetry within the Generalized Binding framework, in association with the referential/nonreferential distinction among Wh-elements, with the ECP reduced to the generalized binding principles (GBPs).
Linguistic InquiryEconomy of derivation and the generalized proper binding condition
141 Citations1994Christopher Collins
Syntactic Variables: Resumptive Pronouns and A′ Binding in Palauan
139 Citations1991Carol Georgopoulos
This chapter discusses the Variable Binding Structures, embedded questions and the Scope of WH Phrases, and crossover Constructions of Palauan Grammar.
Rutgers University Community Repository (Rutgers University)Computational Optimality Theory
128 Citations1995Bruce Tesar
A class of learning algorithms, the Constraint Demotion algorithms, are presented, which solve the problem of learning constraint rankings based upon hypothesized structural descriptions (an important subproblem of the general problem of language learning).
Rutgers University Community Repository (Rutgers University)The Learnability of Optimality Theory: An Algorithm and Some Basic Complexity Results
114 Citations1995Bruce Tesar, Paul Smolensky
The learnability of grammars in Optimality Theory is investigated, and a simple and efficient algorithm is presented for solving the special nature of the learning problem in that theory.
Rutgers University Community Repository (Rutgers University)Constraints on subjects: an optimality theoretic analysis
90 Citations1996Vieri Samek-Lodovici
A grammar of Lango
86 Citations1992Michael Noonan
Studies in linguistics and philosophyLF Movement in Iraqi Arabic
70 Citations1992Wafaa Abd al-Faheem Batran Wahba
Studies in natural language and linguistic theoryThe Role of the Antecedent in Anaphoric Relations
36 Citations1996Luigi Burzio
Computing Optimal Forms in Optimality Theory: Basic Syllabification
18 Citations2004Bruce Tesar
An analysis of the Basic CV Syllable Theory (Prince & Smolensky 1993) is presented showing that, despite the nature of the formal definition, computing the optimal form does not require explicitly generating and evaluating all possible candidates.