【24h】

List-only Entity Linking

机译:仅列表实体链接

获取原文

摘要

Traditional Entity Linking (EL) technologies rely on rich structures and properties in the target knowledge base (KB). However, in many applications, the KB may be as simple and sparse as lists of names of the same type (e.g., lists of products). We call it as List-only Entity Linking problem. Fortunately, some mentions may have more cues for linking, which can be used as seed mentions to bridge other mentions and the uninformative entities. In this work, we select the most linkable mentions as seed mentions and disambiguate other mentions by comparing them with the seed mentions rather than directly with the entities. Our experiments on linking mentions to seven automatically mined lists show promising results and demonstrate the effectiveness of our approach.
机译:传统的实体链接(EL)技术依赖于目标知识库(KB)中的丰富结构和属性。但是,在许多应用中,KB可能与相同类型的名称列表(例如产品列表)一样简单和稀疏。我们称其为“仅列表实体链接”问题。幸运的是,某些提及可能具有更多的链接提示,这些线索可以用作种子提及,以桥接其他提及和非信息性实体。在这项工作中,我们选择最可链接的提及作为种子提及,并通过将它们与种子提及而不是直接与实体进行比较来消除其他提及的歧义。我们将提及链接到七个自动挖掘的列表的实验显示出令人鼓舞的结果,并证明了我们方法的有效性。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号