Formal Models of Question-Answering Machine
Igor Chimir, Anatolii Verlan · 2021
The article describes two models of question-answering dialogue machine: (1) model based on the idea of Mealy finite automata, and (2) model based on the idea of Petri net.Both models are problem-independent and describe question-answering dialogue process, which is independent of the subject area of the dialogue.The problem independence of the models is a consequence of a unified cognitive cycle of dialogue used in them.The unified cognitive cycle of dialogue is similar to Neisser's cyclical model of perception.Models are designed to specify a "dialogue machine" that simulates a goal-oriented behavior of the active dialogue agent when solving a problem by means of a question-answering dialogue.Implementation of the models presupposes data-driven approach when main components of the "dialogue machine" are not map in the program code but represented by data stored in the database.