提出一种新的压缩数据结构compactdatastructure.PPTVIP

  • 12
  • 0
  • 约5.99千字
  • 约 39页
  • 2018-06-09 发布于天津
  • 举报

提出一种新的压缩数据结构compactdatastructure.PPT

提出一种新的压缩数据结构compactdatastructure

A Compact Forest for Scalable Inference over Entailment and Paraphrase Rules Roy Bar-Haim, Jonathan Berant, Ido Dagan 2009 ACL and AFNLP Speaker: Guanghui Luo 大纲 介绍(Introduction) 推理框架(Inference Framework) 在压缩句法森林的有效推理 (Efficient Inference over Compact Parse Forests) 实践评价(Empirical Evaluation) 相关工作(Related Work) 结论(Conclusion) 介绍(Introduction) 几个概念: Entailment rules—They are rules where the left hand side(LHS) specifies some knowledge which entails the knowledge expresend in the RHS of the rule, with some degree of confidence. Example: Children are fond of ca

文档评论(0)

1亿VIP精品文档

相关文档