依赖树的中心数、长度、交叉数及其关系
Hubiness, length, crossings and their relationships in dependency trees
摘要：
在这里，树依赖结构从三个不同的角度进行了研究：它们的度方差（hubiness），平均依赖长度和依赖交叉的数量。揭示这三个指标之间的成对依赖关系的界限。Hubiness（度的方差）起着核心作用：平均依赖长度的下限是hubiness，而交叉次数的上限是hubiness。我们的研究结果表明，一个句子的在线记忆成本可能不仅取决于单词的顺序，还取决于底层结构的密集程度。度的二阶矩起着至关重要的作用，这让人想起它在大型复杂网络中的作用。
英文摘要：
Here tree dependency structures are studied from three different perspectives: their degree variance (hubiness), the mean dependency length and the number of dependency crossings. Bounds that reveal pairwise dependencies among these three metrics are derived. Hubiness (the variance of degrees) plays a central role: the mean dependency length is bounded below by hubiness while the number of crossings is bounded above by hubiness. Our findings suggest that the online memory cost of a sentence might be determined not just by the ordering of words but also by the hubiness of the underlying structure. The 2nd moment of degree plays a crucial role that is reminiscent of its role in large complex networks.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
