Investigation of the viability of direct evaluation of natural language queries with respect to event based triplestores

网络包含大量的知识;大部分编码在自然语言（NL）文本中。为了便于计算机处理，已经启动了几个项目，从文本中提取数据，以通用格式编码，并将其存储在灵活的数据结构中，这些数据结构被称为二进制关系存储，基于图形的数据库或三重存储，其中实体和关系被赋予全球唯一的名称，称为统一资源标识符（URI）。这些灵活的数据结构统称为“语义网”。URI使世界各地的人们能够添加有关同一实体的数据。一个示例三重存储是DBpedia，其中包含从维基百科网络知识库中提取的大约30亿个事实。语义网可以使用正式查询语言SPARQL（类似于关系数据库查询语言SQL）进行查询。SPARQL需要时间来学习，对许多人来说并不容易。如果可以使用NL访问三重存储，这将是有用的。很少或没有计算机专业知识的用户可以用他们喜欢的NL提问。几个NL查询接口（NLQI）的语义Web已经建成，大多数转换NL查询SPARQL。 由于稍后解释的原因，没有现有的NLQI可以容纳包含任意嵌套的量化、否定和链式复杂介词短语的复杂查询，例如在查询“who discovered a moon that orbit mars with a telescope？"中，以及“哪个行星没有卫星围绕"另一种方法是将NL查询视为lambda演算的表达式，并直接针对存储的数据对其进行评估。这类似于算术表达式的计算方式。对于NL查询，一些词表示从三元组存储中检索的值，一些词表示数学函数，并且函数应用的顺序通过使用用于表达查询的语言的语法来解析查询来确定。在过去的2年里，我们已经开发了一套含义（语义）的各种英语单词用于语义网络查询处理。作为概念的证明，我们已经将我们的语义与英语解析器集成在一起，并建立了一个原型接口，可以连接到一个包含6,000个关于行星和卫星的事实的远程三重数据库。查询处理器可以处理数百万个查询，比如“哪颗环绕木星运行的真空卫星是1938年在威尔逊山由尼科尔森或霍尔用望远镜发现的？”(more后面的例子）。查询界面可通过以下网址访问： http://speechweb2.cs.uwindsor.ca/solarman2/demo_sparql.html***The接下来的步骤是1）调查我们的方法用于大规模三重存储的可行性，如DBpedia，2）调查如何帮助克服用户缺乏用于命名实体的URI的知识，以及3）使用已建立的基准查询集调查召回率和精度方面的性能。

The web contains a huge amount of knowledge; much encoded in natural-language (NL) text. To facilitate processing by computer, several projects have been launched to extract data from text, encode it in a common format and store it in flexible data structures, variously called binary-relational stores, graph-based databases or triplestores, in which entities and relationships are given worldwide unique names called Uniform Resource Identifiers (URIs). These flexible data structures are collectively called the “semantic web”. The URIs enable data about the same entity to be added by people across the world. An example triplestore is DBpedia with approximately 3 billion facts extracted from the Wikipedia web knowledge base.***The semantic web can be queried using the formal query language SPARQL (similar to the relational database query language SQL). SPARQL requires time to learn and it is not easy for many people.***It would be useful if triplestores could be accessed using NL. Users with little or no computer expertise could then ask questions in their preferred NL. Several NL query interfaces (NLQIs) to the semantic web have been built; most convert the NL query to SPARQL. For reasons that are explained later, no existing NLQI can accommodate complex queries containing arbitrarily-nested quantification, negation, and chained complex prepositional phrases, such as in the queries “who discovered a moon that orbits mars with a telescope?”, and “which planet is orbited by no moon?”***An alternative approach is to treat NL queries as expressions of the lambda calculus and evaluate them directly with respect to the stored data. This is similar to the way in which arithmetic expressions are evaluated. For NL queries, some words denote values which are retrieved from the triplestores, some words denote mathematical functions, and the order of function application is determined by parsing the query using a grammar for the language in which the query was expressed.***Over the last 2 years, we have developed a set of meanings (a semantics) for various words of English for use in Semantic-web query processing. As proof of concept, we have integrated our semantics with an English parser, and have built a prototype interface to a remote triplestore containing 6,000 facts about the planets and moons. The query processor can handle millions of queries such as “which vacuumous moon that orbits jupiter was discovered by nicholson or hall with a telescope in 1938 in mt_wilson?” (more examples given later). The query interface is accessible at: http://speechweb2.cs.uwindsor.ca/solarman2/demo_sparql.html***The next steps are to 1) investigate the viability of our approach for use with massive triplestores, such as DBpedia, 2) to investigate how to help overcome users lack of knowledge of the URIs used for naming entities, and 3) to investigate performance with respect to recall and precision using established benchmark query sets.********