scholarly journals Evaluating the Usability of Natural Language Query Languages and Interfaces to Semantic Web Knowledge Bases

2010 ◽  
Author(s):  
Esther Kaufmann ◽  
Abraham Bernstein
Keyword(s):  
Semantic Web ◽  
Natural Language ◽  
Knowledge Bases ◽  
Query Languages ◽  
Natural Language Query ◽  
Web Knowledge

Evaluating search features of Google Knowledge Graph and Bing Satori

2015 ◽  
Vol 39 (2) ◽  
pp. 197-213 ◽  
Author(s):  
Ahmet Uyar ◽  
Farouk Musa Aliyu
Keyword(s):  
Semantic Web ◽  
Natural Language ◽  
Search Engines ◽  
Web Search ◽  
Semantic Search ◽  
Knowledge Graph ◽  
Content Type ◽  
Query Interfaces ◽  
Natural Language Query ◽  
Web Search Engines

Purpose – The purpose of this paper is to better understand three main aspects of semantic web search engines of Google Knowledge Graph and Bing Satori. The authors investigated: coverage of entity types, the extent of their support for list search services and the capabilities of their natural language query interfaces. Design/methodology/approach – The authors manually submitted selected queries to these two semantic web search engines and evaluated the returned results. To test the coverage of entity types, the authors selected the entity types from Freebase database. To test the capabilities of natural language query interfaces, the authors used a manually developed query data set about US geography. Findings – The results indicate that both semantic search engines cover only the very common entity types. In addition, the list search service is provided for a small percentage of entity types. Moreover, both search engines support queries with very limited complexity and with limited set of recognised terms. Research limitations/implications – Both companies are continually working to improve their semantic web search engines. Therefore, the findings show their capabilities at the time of conducting this research. Practical implications – The results show that in the near future the authors can expect both semantic search engines to expand their entity databases and improve their natural language interfaces. Originality/value – As far as the authors know, this is the first study evaluating any aspect of newly developing semantic web search engines. It shows the current capabilities and limitations of these semantic web search engines. It provides directions to researchers by pointing out the main problems for semantic web search engines.

A semantic-based approach for querying linked data using natural language

2016 ◽  
Vol 42 (6) ◽  
pp. 851-862 ◽  
Author(s):  
Mario Andrés Paredes-Valverde ◽  
Rafael Valencia-García ◽  
Miguel Ángel Rodríguez-García ◽  
Ricardo Colomo-Palacios ◽  
Giner Alor-Hernández
Keyword(s):  
Semantic Web ◽  
Natural Language ◽  
Knowledge Bases ◽  
Semantic Knowledge ◽  
Semantic Web Technologies ◽  
Web Technologies ◽  
Natural Language Interface ◽  
High Quality Information ◽  
Domain Independent

The semantic Web aims to provide to Web information with a well-defined meaning and make it understandable not only by humans but also by computers, thus allowing the automation, integration and reuse of high-quality information across different applications. However, current information retrieval mechanisms for semantic knowledge bases are intended to be only used by expert users. In this work, we propose a natural language interface that allows non-expert users the access to this kind of information through formulating queries in natural language. The present approach uses a domain-independent ontology model to represent the question’s structure and context. Also, this model allows determination of the answer type expected by the user based on a proposed question classification. To prove the effectiveness of our approach, we have conducted an evaluation in the music domain using LinkedBrainz, an effort to provide the MusicBrainz information as structured data on the Web by means of Semantic Web technologies. Our proposal obtained encouraging results based on the F-measure metric, ranging from 0.74 to 0.82 for a corpus of questions generated by a group of real-world end users.

scholarly journals Complex Program Induction for Querying Knowledge Bases in the Absence of Gold Programs

2019 ◽  
Vol 7 ◽  
pp. 185-200 ◽  
Author(s):  
Amrita Saha ◽  
Ghulam Ahmed Ansari ◽  
Abhishek Laddha ◽  
Karthik Sankaranarayanan ◽  
Soumen Chakrabarti
Keyword(s):  
Natural Language ◽  
Question Answering ◽  
Knowledge Bases ◽  
Combinatorial Explosion ◽  
Complex Queries ◽  
Present Complex ◽  
Complex Program ◽  
Natural Language Query ◽  
High Level ◽  
Complex Question

Recent years have seen increasingly complex question-answering on knowledge bases (KBQA) involving logical, quantitative, and comparative reasoning over KB subgraphs. Neural Program Induction (NPI) is a pragmatic approach toward modularizing the reasoning process by translating a complex natural language query into a multi-step executable program. While NPI has been commonly trained with the ‘‘gold’’ program or its sketch, for realistic KBQA applications such gold programs are expensive to obtain. There, practically only natural language queries and the corresponding answers can be provided for training. The resulting combinatorial explosion in program space, along with extremely sparse rewards, makes NPI for KBQA ambitious and challenging. We present Complex Imperative Program Induction from Terminal Rewards (CIPITR), an advanced neural programmer that mitigates reward sparsity with auxiliary rewards, and restricts the program space to semantically correct programs using high-level constraints, KB schema, and inferred answer type. CIPITR solves complex KBQA considerably more accurately than key-value memory networks and neural symbolic machines (NSM). For moderately complex queries requiring 2- to 5-step programs, CIPITR scores at least 3× higher F1 than the competing systems. On one of the hardest class of programs (comparative reasoning) with 5–10 steps, CIPITR outperforms NSM by a factor of 89 and memory networks by 9 times. 1

SWFQA Semantic Web Based Framework for Question Answering

2019 ◽  
Vol 9 (1) ◽  
pp. 88-106
Author(s):  
Irphan Ali ◽  
Divakar Yadav ◽  
Ashok Kumar Sharma
Keyword(s):  
Semantic Web ◽  
Natural Language ◽  
Knowledge Base ◽  
Language Processing ◽  
Question Answering ◽  
Knowledge Bases ◽  
Digital Information ◽  
Web Based ◽  
Question Answering System ◽  
User Query

A question answering system aims to provide the correct and quick answer to users' query from a knowledge base. Due to the growth of digital information on the web, information retrieval system is the need of the day. Most recent question answering systems consult knowledge bases to answer a question, after parsing and transforming natural language queries to knowledge base-executable forms. In this article, the authors propose a semantic web-based approach for question answering system that uses natural language processing for analysis and understanding the user query. It employs a “Total Answer Relevance Score” to find the relevance of each answer returned by the system. The results obtained thereof are quite promising. The real-time performance of the system has been evaluated on the answers, extracted from the knowledge base.

scholarly journals Natural language query formalization to SPARQL for querying knowledge bases using Rasa

2021 ◽  
Author(s):  
Divyansh Shankar Mishra ◽  
Abhinav Agarwal ◽  
B. P. Swathi ◽  
K C. Akshay
Keyword(s):  
Natural Language ◽  
Linked Data ◽  
Query Language ◽  
Open Data ◽  
Knowledge Bases ◽  
Computer Applications ◽  
Closed Domain ◽  
Entity Extraction ◽  
Web 3.0 ◽  
Natural Language Query

AbstractThe idea of data to be semantically linked and the subsequent usage of this linked data with modern computer applications has been one of the most important aspects of Web 3.0. However, the actualization of this aspect has been challenging due to the difficulties associated with building knowledge bases and using formal languages to query them. In this regard, SPARQL, a recursive acronym for standard query language and protocol for Linked Open Data and Resource Description Framework databases, is a most popular formal querying language. Nonetheless, writing SPARQL queries is known to be difficult, even for experts. Natural language query formalization, which involves semantically parsing natural language queries to their formal language equivalents, has been an essential step in overcoming this steep learning curve. Recent work in the field has seen the usage of artificial intelligence (AI) techniques for language modelling with adequate accuracy. This paper discusses a design for creating a closed domain ontology, which is then used by an AI-powered chat-bot that incorporates natural language query formalization for querying linked data using Rasa for entity extraction after intent recognition. A precision–recall analysis is performed using in-built Rasa tools in conjunction with our own testing parameters, and it is found that our system achieves a precision of 0.78, recall of 0.79 and F1-score of 0.79, which are better than the current state of the art.

Sign in / Sign up

Export Citation Format

Share Document