首页> 外文会议>Second workshop on universal dependencies >Integration complexity and the order of cosisters
【24h】

Integration complexity and the order of cosisters

机译:集成复杂度和余弦的阶数

获取原文
获取原文并翻译 | 示例

摘要

The cost of integrating dependent constituents to their heads is thought to involve the distance between dependent and head and the complexity of the integration (Gibson, 1998). The former has been convincingly addressed by Dependency Distance Minimization (DDM) (cf. Liu et al., 2017). The current study addresses the latter by proposing a novel theory of integration complexity derived from the entropy of the probability distribution of a dependent's heads. An analysis of Universal Dependency corpora provides empirical evidence regarding the preferred order of isomorphic cosisters-sister constituents of the same syntactic form on the same side of their head-such as the adjectives in pretty blue fish. Integration complexity, alongside DDM, allows for a general theory of constituent order based on integration cost.
机译:人们认为,将受抚养成分人整合到其头部的成本涉及受抚养者与头部之间的距离以及整合的复杂性(Gibson,1998)。依赖距离最小化(DDM)令人信服地解决了前者(Liu et al。,2017)。当前的研究通过提出一种新的综合复杂性理论来解决后者,该理论是从受抚养人头的概率分布的熵中得出的。对通用依赖语料库的分析提供了关于在其头部的同一侧上具有相同句法形式的同构余生-姐妹成分的优选顺序的经验证据,例如漂亮的蓝色鱼中的形容词。集成复杂度与DDM一起,允许基于集成成本的组成顺序的一般理论。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号