arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2102.05444cs.IR
收藏

基于相似实体的信息抽取

Information Extraction From Co-Occurring Similar Entities

Nicolas Heist, Heiko Paulheim

摘要:

关于实体及其相互关系的知识是问答或文本摘要等任务成功的关键因素。然而,像Wikidata或DBpedia这样公开可用的知识图谱还远未完成。在本文中,我们探讨如何从类似的实体,共同出现在结构,如表或列表中提取的信息可以帮助增加这种知识图谱的覆盖面。与现有方法相比,我们不关注列表中的关系(例如,表行中的两个实体之间),而是取决于列表的主题实体与列表的上下文之间的关系。为此,我们提出了一个描述性的规则挖掘方法,使用远程监督,以获得规则,这些关系的基础上上市的上下文。从合适的数据语料库中提取的规则可以用于扩展具有新实体和断言的知识图谱。在我们的实验中,我们证明了该方法能够从维基百科的列表中提取多达3M的新实体和30M的附加断言。我们发现,提取的信息是高质量的,因此适合扩展基于维基百科的知识图谱,如DBpedia,YAGO和CaLiGraph。对于DBpedia来说,这将导致覆盖的实体增加大约50%。

英文摘要:

Knowledge about entities and their interrelations is a crucial factor of success for tasks like question answering or text summarization. Publicly available knowledge graphs like Wikidata or DBpedia are, however, far from being complete. In this paper, we explore how information extracted from similar entities that co-occur in structures like tables or lists can help to increase the coverage of such knowledge graphs. In contrast to existing approaches, we do not focus on relationships within a listing (e.g., between two entities in a table row) but on the relationship between a listing's subject entities and the context of the listing. To that end, we propose a descriptive rule mining approach that uses distant supervision to derive rules for these relationships based on a listing's context. Extracted from a suitable data corpus, the rules can be used to extend a knowledge graph with novel entities and assertions. In our experiments we demonstrate that the approach is able to extract up to 3M novel entities and 30M additional assertions from listings in Wikipedia. We find that the extracted information is of high quality and thus suitable to extend Wikipedia-based knowledge graphs like DBpedia, YAGO, and CaLiGraph. For the case of DBpedia, this would result in an increase of covered entities by roughly 50%.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑