scholarly journals A relational tsetlin machine with applications to natural language understanding

2022 ◽  
Author(s):  
Rupsa Saha ◽  
Ole-Christoffer Granmo ◽  
Vladimir I. Zadorozhny ◽  
Morten Goodwin
Keyword(s):  
Natural Language ◽  
Real World ◽  
Question Answering ◽  
Logic Program ◽  
Closed Domain ◽  
Computing Power ◽  
First Order ◽  
Finite State ◽  
Order Representation ◽  
Pattern Recognition Approach

AbstractTsetlin machines (TMs) are a pattern recognition approach that uses finite state machines for learning and propositional logic to represent patterns. In addition to being natively interpretable, they have provided competitive accuracy for various tasks. In this paper, we increase the computing power of TMs by proposing a first-order logic-based framework with Herbrand semantics. The resulting TM is relational and can take advantage of logical structures appearing in natural language, to learn rules that represent how actions and consequences are related in the real world. The outcome is a logic program of Horn clauses, bringing in a structured view of unstructured data. In closed-domain question-answering, the first-order representation produces 10 × more compact KBs, along with an increase in answering accuracy from 94.83% to 99.48%. The approach is further robust towards erroneous, missing, and superfluous information, distilling the aspects of a text that are important for real-world understanding

scholarly journals QUASE: AN Ontology-Based Domain Specific Natural Language Question Answering System

2019 ◽  
Vol 8 (4) ◽  
pp. 261-268
Keyword(s):  
Natural Language ◽  
Language Processing ◽  
Question Answering ◽  
Closed Domain ◽  
Question Answering System ◽  
Pos Tagging ◽  
Part Of Speech ◽  
Natural Language Question ◽  
Finite Set ◽  
Language Question

Since early days Question Answering (QA) has been an intuitive way of understanding the concept by humans. Considering its inevitable importance it has been introduced to children from very early age and they are promoted to ask more and more questions. With the progress in Machine Learning & Ontological semantics, Natural Language Question Answering (NLQA) has gained more popularity in recent years. In this paper QUASE (QUestion Answering System for Education) question answering system for answering natural language questions has been proposed which help to find answer for any given question in a closed domain containing finite set of documents. Th e QA s y st em m a inl y focuses on factoid questions. QUASE has used Question Taxonomy for Question Classification. Several Natural Language Processing techniques like Part of Speech (POS) tagging, Lemmatization, Sentence Tokenization have been applied for document processing to make search better and faster. DBPedia ontology has been used to validate the candidate answers. By application of this system the learners can gain knowledge on their own by getting precise answers to their questions asked in natural language instead of getting back merely a list of documents. The precision, recall and F measure metrics have been taken into account to evaluate the performance of answer type evaluation. The metric Mean Reciprocal Rank has been considered to evaluate the performance of QA system. Our experiment has shown significant improvement in classifying the questions in to correct answer types over other methods with approximately 91% accuracy and also providing better performance as a QA system in closed domain search.

scholarly journals Ontology-Based Approach to Semantically Enhanced Question Answering for Closed Domain: A Review

Information ◽  
2021 ◽  
Vol 12 (5) ◽  
pp. 200
Author(s):  
Ammar Arbaaeen ◽  
Asadullah Shah
Keyword(s):  
Information Retrieval ◽  
Literature Review ◽  
Natural Language ◽  
Language Processing ◽  
Question Answering ◽  
Semantic Annotation ◽  
Closed Domain ◽  
Ontological Approach ◽  
Semantically Enhanced ◽  
Review Reports

For many users of natural language processing (NLP), it can be challenging to obtain concise, accurate and precise answers to a question. Systems such as question answering (QA) enable users to ask questions and receive feedback in the form of quick answers to questions posed in natural language, rather than in the form of lists of documents delivered by search engines. This task is challenging and involves complex semantic annotation and knowledge representation. This study reviews the literature detailing ontology-based methods that semantically enhance QA for a closed domain, by presenting a literature review of the relevant studies published between 2000 and 2020. The review reports that 83 of the 124 papers considered acknowledge the QA approach, and recommend its development and evaluation using different methods. These methods are evaluated according to accuracy, precision, and recall. An ontological approach to semantically enhancing QA is found to be adopted in a limited way, as many of the studies reviewed concentrated instead on NLP and information retrieval (IR) processing. While the majority of the studies reviewed focus on open domains, this study investigates the closed domain.

1243-P: Novel Use of Natural Language Processing to Identify Reasons for Insulin Discontinuation in Patients with T2DM: A Real-World Evidence Study

Diabetes ◽  
2019 ◽  
Vol 68 (Supplement 1) ◽  
pp. 1243-P
Author(s):  
JIANMIN WU ◽  
FRITHA J. MORRISON ◽  
ZHENXIANG ZHAO ◽  
XUANYAO HE ◽  
MARIA SHUBINA ◽  
...  
Keyword(s):  
Natural Language Processing ◽  
Natural Language ◽  
Language Processing ◽  
Real World ◽  
Real World Evidence

scholarly journals Special issue on ‘Program development’

2002 ◽  
Vol 2 (4-5) ◽  
pp. 423-424 ◽  
Author(s):  
MAURICE BRUYNOOGHE ◽  
KUNG-KIU LAU
Keyword(s):  
Software Engineering ◽  
Program Development ◽  
Real World ◽  
Development Process ◽  
Logic Program ◽  
Future Challenge ◽  
Special Issue ◽  
Logical Foundations ◽  
The Past ◽  
Specification Synthesis

This special issue marks the tenth anniversary of the LOPSTR workshop. LOPSTR started in 1991 as a workshop on Logic Program Synthesis and Transformation, but later it broadened its scope to logic-based Program Development in general.The motivating force behind LOPSTR has been a belief that declarative paradigms such as logic programming are better suited to program development tasks than traditional non-declarative ones such as the imperative paradigm. Specification, synthesis, transformation or specialisation, analysis, verification and debugging can all be given logical foundations, thus providing a unifying framework for the whole development process.In the past ten years or so, such a theoretical framework has indeed begun to emerge. Even tools have been implemented for analysis, verification and specialisation. However, it is fair to say that so far the focus has largely been on programming-in-the-small. So the future challenge is to apply or extend these techniques to programming-in-the-large, in order to tackle software engineering in the real world.

scholarly journals Composing Questions through Conceptual Authoring

2007 ◽  
Vol 33 (1) ◽  
pp. 105-133 ◽  
Author(s):  
Catalina Hallett ◽  
Donia Scott ◽  
Richard Power
Keyword(s):  
Natural Language ◽  
Question Answering ◽  
Free Text ◽  
Risk Averse ◽  
Proof Of Concept ◽  
Concept System ◽  
Complex Queries ◽  
Extensive Training ◽  
Question Answering Systems ◽  
Medical Histories

This article describes a method for composing fluent and complex natural language questions, while avoiding the standard pitfalls of free text queries. The method, based on Conceptual Authoring, is targeted at question-answering systems where reliability and transparency are critical, and where users cannot be expected to undergo extensive training in question composition. This scenario is found in most corporate domains, especially in applications that are risk-averse. We present a proof-of-concept system we have developed: a question-answering interface to a large repository of medical histories in the area of cancer. We show that the method allows users to successfully and reliably compose complex queries with minimal training.

Sign in / Sign up

Export Citation Format

Share Document