|
|
|
|
LEADER |
00000cam a2200000 a 4500 |
001 |
ocn778448497 |
003 |
OCoLC |
005 |
20241006213017.0 |
006 |
m o d |
007 |
cr cnu---unuuu |
008 |
120228s2012 enka ob 001 0 eng d |
040 |
|
|
|a N$T
|b eng
|e pn
|c N$T
|d STF
|d YDXCP
|d E7B
|d OCLCQ
|d OCLCF
|d OCLCQ
|d EBLCP
|d OCLCQ
|d STBDS
|d OCLCQ
|d YOU
|d OCLCQ
|d K6U
|d OCLCO
|d SFB
|d OCLCO
|d OCLCQ
|d OCLCO
|
019 |
|
|
|a 775870059
|a 785782747
|a 922971103
|a 1298425420
|a 1370510063
|
020 |
|
|
|a 9780191635588
|q (electronic bk.)
|
020 |
|
|
|a 0191635588
|q (electronic bk.)
|
020 |
|
|
|a 9780191731402
|q (ebook)
|
020 |
|
|
|a 0191731404
|q (ebook)
|
020 |
|
|
|z 9780199593538
|
020 |
|
|
|z 9780199593521
|
020 |
|
|
|z 0199593523
|
020 |
|
|
|z 0199593531
|
035 |
|
|
|a (OCoLC)778448497
|z (OCoLC)775870059
|z (OCoLC)785782747
|z (OCoLC)922971103
|z (OCoLC)1298425420
|z (OCoLC)1370510063
|
050 |
|
4 |
|a P158.28
|b .U75 2012eb
|
072 |
|
7 |
|a LAN
|x 006000
|2 bisacsh
|
072 |
|
7 |
|a LAN
|x 009060
|2 bisacsh
|
049 |
|
|
|a HCDD
|
100 |
1 |
|
|a Uriagereka, Juan.
|
245 |
1 |
0 |
|a Spell-out and the minimalist program /
|c Juan Uriagereka.
|
260 |
|
|
|a Oxford ;
|a New York :
|b Oxford University Press,
|c 2012.
|
300 |
|
|
|a 1 online resource (ix, 349 pages) :
|b illustrations
|
336 |
|
|
|a text
|b txt
|2 rdacontent
|
337 |
|
|
|a computer
|b c
|2 rdamedia
|
338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
490 |
1 |
|
|a Oxford linguistics
|
504 |
|
|
|a Includes bibliographical references (pages 314-341) and index.
|
588 |
0 |
|
|a Print version record.
|
520 |
8 |
|
|a Juan Uriagereka explores important consequences of the multiple spell-out hypothesis and of the linked notion of cyclicity. He combines the latest thinking in linguistics with perspectives drawn from physics, biology, and animal behaviour.
|
505 |
0 |
|
|a Cover -- Contents -- Acknowledgments -- Introduction -- 1. Derivations -- 2. The extension of computational theories -- 3. The main argument for bottom-up systems -- 4. How the cycle colors the orthogonality of computations -- 5. Three factors of language design -- 6. What sort of computational complexity? -- 7. Evo-devo considerations -- 8. Dynamical frustration as a third factor -- 9. The CLASH model -- 10. Ultrametricity in syntax? -- 11. The Multiple Spell-out attempt to rationalize the cycle -- 1 Linearization
|
505 |
8 |
|
|a 1.1. Conceptualizing the Squeezing Problem1.2. The Finite State Limit on phrase structure -- 1.3. Context-sensitive dependencies -- 1.4. Context-sensitive asymmetries -- 1.5. Incremental parsing and information flow -- 1.6. Linearizing complex branchings -- 1.7. LCA vs. MLCA parsing of complex structures -- 1.8. Conclusions -- 2 Sub-extraction -- 2.1. A summary of the MSO proposal based on the LCT -- 2.2. Off-line information -- 2.3. Possible subject sub-extractions? -- 2.4. Genuine subject sub-extractions -- 2.5. A careful experiment
|
505 |
8 |
|
|a ""2.6. Adjunct sub-extraction""""2.7. Conclusions""; ""3 C-command""; ""3.1. An architecture based on c-command""; ""3.2. C-command throughout""; ""3.3. C-command in construal""; ""3.4. C-command in morpho-phonemics""; ""3.5. Is c-command derived or eliminated?""; ""3.6. Beyond c-command""; ""3.7. Conclusions""; ""4 Cyclicity""; ""4.1. Multiple cyclicity conditions""; ""4.2. Cyclicity within compounds""; ""4.3. Is compounding recursive?""; ""4.4. Compounding as atomization and the notion �head of the compound�""; ""4.5. Parametric differences in Spell-out?""
|
505 |
8 |
|
|a 4.6. Reconstruction effects4.7. Adjunct deactivation and linearization -- 4.8. Adjunct opacity -- 4.9. Conclusions -- 5 Antecedents and Consequents -- 5.1. Antecedents -- 5.2. Phases -- 5.3. Repair -- 5.4. Is linearization represented? -- 5.5. Interfacing currents -- 5.6. Reprojections -- 5.7. Psycholinguistic consequences -- 5.8. Conclusions -- 6 The Frustrating Equation -- 6.1. Dynamical frustration -- 6.2. 3rd factor considerations -- 6.3. Systemic memory -- 6.4. A biophysics of language? -- 6.5. Parsing birdsongs? -- 6.6. A physics for birdsong?
|
505 |
8 |
|
|a 6.7. Frustration in birdsong patterns?6.8. Effective recursion -- 6.9. The Transfer Hypothesis -- 6.10. Conclusions -- 7 A CLASH Model -- 7.1. Taking stock -- 7.2. The dual nature of language -- 7.3. A formal system -- 7.4. Reversing the flow of PF -- 7.5. Fibonacci patterns in grammar -- 7.6. Predicting the properties of the Merge operation -- 7.7. On the periodicity of phases -- 7.8. Bottom-up syntax at a higher dimension -- 7.9. 3rd factor redux -- 7.10. Conclusions -- References -- Index -- A -- B -- C -- D -- E -- F -- G -- H -- I
|
650 |
|
0 |
|a Minimalist theory (Linguistics)
|
650 |
|
0 |
|a Grammar, Comparative and general
|x Syntax.
|
650 |
|
0 |
|a Cognitive grammar.
|
650 |
|
7 |
|a LANGUAGE ARTS & DISCIPLINES
|x Grammar & Punctuation.
|2 bisacsh
|
650 |
|
7 |
|a LANGUAGE ARTS & DISCIPLINES
|x Linguistics
|x Syntax.
|2 bisacsh
|
650 |
|
7 |
|a Cognitive grammar
|2 fast
|
650 |
|
7 |
|a Grammar, Comparative and general
|x Syntax
|2 fast
|
650 |
|
7 |
|a Minimalist theory (Linguistics)
|2 fast
|
776 |
0 |
8 |
|i Print version:
|a Uriagereka, Juan.
|t Spell-out and the minimalist program.
|d Oxford ; New York : Oxford University Press, 2012
|z 9780199593538
|w (OCoLC)751726103
|
830 |
|
0 |
|a Oxford linguistics.
|
856 |
4 |
0 |
|u https://holycross.idm.oclc.org/login?auth=cas&url=https://academic.oup.com/book/12196
|y Click for online access
|
903 |
|
|
|a OUP-SOEBA
|
994 |
|
|
|a 92
|b HCD
|