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).