STARKE, Michal. Complex left branches, spellout, and prefixes. In Baunaz, Lena and De Clercq, Karen and Haegeman, Liliane and Lander, Eric. Exploring Nanosyntax. New York: Oxford University Press, 2018, p. 239-249. Oxford Studies in Comparative Syntax. ISBN 978-0-19-087674-6. Available from: https://dx.doi.org/10.1093/oso/9780190876746.003.0002.
Other formats:   BibTeX LaTeX RIS
Basic information
Original name Complex left branches, spellout, and prefixes
Authors STARKE, Michal (756 Switzerland, guarantor, belonging to the institution).
Edition New York, Exploring Nanosyntax, p. 239-249, 11 pp. Oxford Studies in Comparative Syntax, 2018.
Publisher Oxford University Press
Other information
Original language English
Type of outcome Chapter(s) of a specialized book
Field of Study 60203 Linguistics
Country of publisher United States of America
Confidentiality degree is not subject to a state or trade secret
Publication form printed version "print"
RIV identification code RIV/00216224:14210/18:00104387
Organization unit Faculty of Arts
ISBN 978-0-19-087674-6
Doi http://dx.doi.org/10.1093/oso/9780190876746.003.0002
Keywords in English antisymmetry; function word; multiple workspaces; nanosyntax; phrasal spell out; prefix; specifier; spellout algorithm
Tags rivok, topvydavatel
Tags International impact, Reviewed
Changed by Changed by: Mgr. Igor Hlaváč, učo 342491. Changed: 2/4/2019 14:11.
Abstract
Higher-function words such as complementizers, negation, functional prepositions, definiteness particles, comparative markers, and so forth, occurring to the left of their lexical category, are argued to be base-generated as complex left branches, rather than spelling out the main functional sequence. This is generalized to all (base-generated) pre-asymmetries and post-asymmetries and derived from the structure of the lexical entries of the function words, dispensing with idiosyncratic notational devices equivalent to [+ suffix] or [+ needs-to-move]. These complex left branches require a merge-XP operation, and the place of this operation in the algorithm of spellout-driven movement is discussed.
PrintDisplayed: 29/7/2024 18:21