【24h】

Treo: Best-Effort Natural Language Queries over Linked Data

机译:Treo:最佳努力自然语言查询链接数据

获取原文
获取外文期刊封面目录资料

摘要

Linked Data promises an unprecedented availability of data on the Web. However, this vision comes together with the associated challenges of querying highly heterogeneous and distributed data. In order to query Linked Data on the Web today, end-users need to be aware of which datasets potentially contain the data and the data model behind these datasets. This query paradigm, deeply attached to the traditional perspective of structured queries over databases, does not suit the heterogeneity and scale of the Web, where it is impractical for data consumers to have an a priori understanding of the structure and location of available datasets. This work describes Treo, a best-effort natural language query mechanism for Linked Data, which focuses on the problem of bridging the semantic gap between end-user natural language queries and Linked Datasets.
机译:链接数据承诺在Web上有前所未有的数据可用性。然而,这种愿景与查询高度异构和分布式数据的相关挑战结合在一起。为了在今天上网上查询网页上的链接数据,最终用户需要知道哪些数据集可能包含这些数据集后面的数据和数据模型。此查询范例,深度附加到数据库上的结构化查询的传统角度,不适合网络的异质性和规模,因为数据消费者对可用数据集的结构和位置进行了先验的理解是不切实际的。这项工作描述了Treo,一种用于链接数据的最佳自然语言查询机制,它侧重于桥接最终用户自然语言查询和链接数据集之间的语义差距问题。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号