Abstract

Objectives. The problem of automating the user information support in decision making system at the stage of describing the problem situation is solved. The relevance of the problem is associated with the need to collect and process significant amounts of information, since in the presence of a large number of factors, a person's capabilities are often insufficient to search and organize the necessary information.When solving the problem of user information support at the stage of describing the problem situation, three main goals are pursued: building a mathematical model of the corresponding processes; formalization of the set of basic concepts of the model; development of the algorithms for implementation of user interaction with the information system.Methods. Methods of set theory, probability theory and graph theory are used.Results. A mathematical model of user information support at the stage of describing a problem situation has been developed. In the process of interacting with the user, the system suggests special templates of sentences and texts for filling. Along with templates, the user receives help texts from the system. They are generated on the basis of the previously developed model of knowledge representation in the form of verbal associations, that is, semantic links between words and phrases corresponding to associative relationships between the entities they designate in the real world.Conclusion. As an implementation of the proposed model, the following algorithms have been developed: an algorithm for creating a dictionary of communicative fragments; algorithms for creating fragment-slot templates for sentences, texts and subject areas; an algorithm of user information support. The vocabulary of communicative fragments is created in four steps in accordance with their formal definition. At each step, four conditions from the given definition are tested sequentially. Fragment-slot templates of sentences are formed by replacing their basic communicative fragments with slots, and text templates - as tuples of templates of their sentences. Fragment-slot templates of subject areas are created in the form of implementation of binary relations reductions on the sets of sentence templates from the corresponding thematic text corpora. Each thematic body of texts defines a certain subject area.

Highlights

  • The user receives help texts from the system. They are generated on the basis of the previously developed model of knowledge representation in the form of verbal associations, that is, semantic links between words and phrases corresponding to associative relationships between the entities they designate in the real world

  • The vocabulary of communicative fragments is created in four steps in accordance with their formal definition

  • Fragment-slot templates of sentences are formed by replacing their basic communicative fragments with slots, and text templates – as tuples of templates of their sentences

Read more

Summary

Если n 2 и

– пороговое значение информативности), то слово a1 будем называть коммуникативным фрагментом. – количество всех предложений в полном корпусе текстов Cf, в которых присутствуют слова a и b или их синонимы и словоизменения, а NCf – количество всех предложений в корпусе Cf. Параметры n Parab Cf и n Synab Cf в формуле (1) указывают на число вхождений всех пар словоформ, являющихся словоизменениями слов a и (или) b (и, соответственно, их синонимами) и встречающихся в одном и том же предложении корпуса текстов Cf:. Dicpar {(a, Para) a WCf, a Para}, состоящий из пар словоформа, парадигма , где WCf – множество всех словоформ полного корпуса текстов Cf, а Para – совокупность всех словоизменений словоформы a;. Dicsyn {(a, Syna) a WCf, a Syna}, включающий в себя пары словоформа, синонимичные словоформы , в которых каждой словоформе a соответствует множество ее синонимов Syna. Am цепочки назовем коммуникативным фрагментом, если справедлива последовательность неравенств Подцепочку a1a2 ... am цепочки назовем коммуникативным фрагментом, если справедлива последовательность неравенств

Если при n 2 выполняется последовательность неравенств
Cft удовлетворяет неравенству f Ct
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call