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

点击翻译按钮获取中文摘要

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.********