首页> 外国专利> UNSUPERVISED ONTOLOGY-BASED GRAPH EXTRACTION FROM TEXTS

UNSUPERVISED ONTOLOGY-BASED GRAPH EXTRACTION FROM TEXTS

机译:文本中未经监督的基于本体的图形提取

摘要

A method for extracting a relations graph uses an ontology graph in which nodes represent entity classes or concepts and edges represent properties of the classes. A property is associated with a constraint which defines a range of values that can be taken without incurring a cost. Input text in which entity and concept mentions are identified is received. An optimal set of alignments between a subgraph of the ontology graph and the identified mentions is identified by optimizing a function of the costs of the constraints incurred by the alignments and a distance measure computed over the set of alignments. A relations graph is generated, based on the optimal set of alignments. The relations graph represents a linked set of relations instantiating a subgraph of the ontology. The relations graph can include relations involving implicit mentions corresponding to subgraph nodes that are not aligned to any of the concept or entity mentions.
机译:一种用于提取关系图的方法使用本体图,其中节点表示实体类或概念,并且边缘表示类的属性。属性与约束条件相关联,该约束条件定义了可以取而不会产生成本的一系列值。接收其中标识了实体和概念提及的输入文本。本体图的子图和所标识的提及之间的最佳对齐方式集合是通过优化对齐方式所产生的约束成本和在对齐方式集合上计算出的距离度量的函数来确定的。基于最佳的一组比对生成关系图。关系图表示实例化本体的子图的关系的链接集。关系图可以包括涉及隐式提及的关系,这些隐式提及对应于与任何概念或实体提及不对齐的子图节点。

著录项

  • 公开/公告号US2017337268A1

    专利类型

  • 公开/公告日2017-11-23

    原文格式PDF

  • 申请/专利权人 XEROX CORPORATION;

    申请/专利号US201615156623

  • 发明设计人 SALAH AIT-MOKHTAR;VASSILINA NIKOULINA;

    申请日2016-05-17

  • 分类号G06F17/30;

  • 国家 US

  • 入库时间 2022-08-21 13:01:22

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号