首页> 外文会议>International conference on natural language processing >Complexity of Dependency Representations for Natural Languages
【24h】

Complexity of Dependency Representations for Natural Languages

机译:自然语言依存表示的复杂性

获取原文

摘要

Most of the formal issues about the complexity of dependency representations are studied via various types of phrase structure grammars and their capabilities for representing dependencies. We will consider a particular kind of phrase structure grammar, well suited to describe various levels of complexity in the context of dependencies. We will relate these representations to some key linguistic issues and the corresponding parsing complexities. We hope mat this work will give some further insight into the limits of dependency representations as well as the associated processing complexities.
机译:通过各种类型的短语结构语法及其表示依赖项的能力,研究了有关依赖项表示的复杂性的大多数形式问题。我们将考虑一种特殊的短语结构语法,它非常适合描述依赖项上下文中的各种复杂程度。我们将把这些表示与一些关键的语言问题和相应的解析复杂性联系起来。我们希望这项工作能够对依赖表示的限制以及相关的处理复杂性提供更多的见解。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号