首页> 外国专利> A METHOD FOR THE EXTRACTION OF RELATION PATTERNS FROM ARTICLES

A METHOD FOR THE EXTRACTION OF RELATION PATTERNS FROM ARTICLES

机译:从文章中提取关系型的方法

摘要

A method for building a knowledge base containing entailment relations, therefore comprises the steps of: a) providing at least one input pattern ( p ) with N pattern slots (N1), said input pattern ( p ) expressing a specific semantic relation between N entities that fill the N pattern slots of the input pattern ( p ) as slot fillers, b) providing at least one cluster ( c ) of articles, said articles of said cluster ( c ) relating to a common main topic; c) processing said articles with respect to the input pattern ( p ) and identifying the identities which match the semantic type of the N pattern slots; d) if said at least one input pattern matches a portion of an article ( a ) of said at least one cluster ( c ): i) storing the N slot fillers (s 1 , s 2 , ... , s N ), which match the slots of the pattern (p), and a cluster identifier lc of the cluster ( c ) into a first table S , wherein the N-tuple (s 1 , s 2 , ... , s N ) and the cluster identifier l c of the associated cluster ( c ) form one element of said table S ; ii) for each element of table S, identifying appearances of the slot fillers (s 1 , s 2 , ... , s N ) in a plurality of articles of cluster ( c ) and for each appearance so identified, storing the slot fillers (s 1 , s 2 , ... , s N ) together with the sentence in which they occur into a second table C 0 ; iii) from the sentences stored in table C 0 , extracting patterns which span over the corresponding N slot fillers (s 1 , s 2 , ... , s N ), said extracted pattern expressing a semantic relation between said N slot fillers; and iv) storing said extracted pattern together with said input pattern as entailment relation into said knowledge base.
机译:因此,一种用于构建包含蕴含关系的知识库的方法包括以下步骤:a)提供至少一个具有N个图案槽(N> 1)的输入图案(p),所述输入图案(p)表示在填充输入图案(p)的N个图案槽的N个实体之间的特定语义关系填充物b)提供至少一个物品群(c),所述物品群(c)的所述物品与共同的主要主题有关;c)关于输入模式(p)处理所述物品,并识别与N个模式槽的语义类型匹配的身份;d)如果所述至少一个输入模式与所述至少一个集群(c)的物品(a)的一部分匹配:i)将与模式(p)的时隙匹配的N个时隙填充符(s 1,s 2,...,s N)和群集(c)的群集标识符lc存储到第一表S中,其中N元组(s 1,s 2,...,s N)和相关联的簇(c)的簇标识符lc构成所述表S的一个元素;ii)对于表S的每个元素,标识多个簇(c)中的槽填充物(s 1,s 2,...,s N)的外观,并针对这样标识的每种外观,存储槽填充物(s 1,s 2,...,s N)和它们出现在其中的句子一起进入第二个表C 0;iii)从存储在表C 0中的句子中,提取跨越相应的N个时隙填充符(s 1,s 2,...,s N)的模式,所述提取的模式表达所述N个时隙填充符之间的语义关系;和iv)将所述提取的模式与所述输入模式作为必然关系存储在所述知识库中。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号