Strange Loops: Phrase-Linking Grammar Meets Kaynean Pronominalization
As shown earlier by Gärtner (2002), linked trees, the graphs used by Phrase-Linking Grammar (Peters & Ritchie 1981) to capture (unbounded) dependencies, can be cyclic under the special condition that two “displaced” constituents end up as sisters of each other. Such “PLG-loops” closely match the particular kind of crossing dependency familiar from Bach-Peters sentences. We will show how PLG-loops allow implementing Bach-Peters configurations in line with the movement-based approach to binding by Kayne (2002). The resulting structures correspond to QR-derived adjunction structures of the kind introduced by May (1985).
No Reference information available - sign in for access.
No Citation information available - sign in for access.
No Supplementary Data.
No Article Media
Document Type: Research Article
Publication date: 01 August 2014
More about this publication?
- "Linguistische Berichte" is open-minded regarding linguistic subjects and methods, but attaches great importance to theoretical reasoning and empirical validation.
Since its foundation in 1969 by Peter Hartmann and Arnim von Stechow, the journal is an academic forum where serious views within linguistics and similar fields of studies (psycholinguistics, sociolinguistics, language acquisition and teaching, literary studies, philosophy, and computer linguistics) are discussed equally.
The purpose is to provide an objective and critical documentation of linguistic developments. Besides, the forum is open for each level of scientific work, i.e. for everyone who is dealing with linguistic-based work (undergraduates, assistants, and professors).
New research results and linguistic developments are published quickly and comprehensively, and contributions are normally published within one year after acceptance by the editors.
- Editorial Board
- Subscribe to this Title
- Ingenta Connect is not responsible for the content or availability of external websites