The linearization of unboundedly many syntactic structures given a finite number of ordering instructions poses a compositionality problem similar to the semantic problem of determining the meanings of unboundedly many structures. We discuss this challenge and use various constructions such as Right‐Node Raising that have been argued to involve multidominance—and that combine a remarkable productivity across and inside languages with a sensitivity to linear order—to tease apart different theories of linearization. We use data from such constructions, including new data provided in the paper, to argue in favor of a specific view of linearization first proposed in Bachrach & Katzir 2009, one in which linearization compatibility requirements are computed very locally, at every node in the structure.

中文翻译：

---

线性化结构

在给定有限数量的排序指令的情况下，无数个语法结构的线性化带来了组成性问题，类似于确定无数个结构的含义的语义问题。我们讨论了这一挑战，并使用了诸如右节点提升（Right-Node Raising）之类的各种结构，这些结构被认为涉及多重支配-并结合了跨语言和内部语言的出色生产力以及对线性顺序的敏感性-来逗弄线性化的不同理论。我们使用来自此类构造的数据（包括本文中提供的新数据）来争辩支持Bachrach和Katzir 2009中首次提出的线性化的特定观点，该观点中线性化兼容性要求是在结构中的每个节点上非常局部地计算的。 。