首页> 外文会议>Conference on empirical methods in natural language processing >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)令人信服地解决(CF.LIU等,2017)。目前的研究通过提出从受抚养人的头部的概率分布的熵熵衍生的集成复杂性的新颖理论来解决后者。对普遍依赖性集团的分析提供了关于同构Orcorphic肥胖形式的优选顺序的经验证据,与他们的头部的同一句法形式的同构 - 如漂亮蓝鱼中的形容词。与DDM一起集成复杂性允许基于集成成本的组成令的一般理论。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号