Method of text search which use linked multiply query

Author(s):  V.V. Serebrovsky, Dr., Prof., South-West State University, Kursk, Russia, sv1111@mail.ru

I.N. Efremova, candidate of Sciences, associate Professor, South-West State University, Kursk, Russia, Efremova-IN@inbox.ru

V.V. Efremov, South-West State University, Kursk, Russia, v2@bk.ru

N.A. Emelianova, Kursk State Medical University, Kursk, Russia, nata-e-@mail.ru

Issue:  Volume 46, № 3

Rubric:  Computer simulation history

Annotation:  One of the fundamental tasks of modern computer information systems is the processing of character information, the volume of which prevails in the total volume of all information. At the present time, the product approach is effectively applied to the tasks of processing symbol information. The paper deals with the specifics of text search using the production approach. The main essence of the approach is to find the occurrences of the sample in the text and possible implementation of substitution (modification of the text). The sample and substitution in the product formula are presented, respectively, as an antecedent and consequent. The paper deals with the specifics of a text search using a production approach as applied to information retrieval tasks. Within the framework of this task, the search information request is presented as an antecedent, and the sequential exists only for the modifying query. The main part of the paper describes a search method developed by the authors using several samples connected by logical functions. At the same time, many samples are connected by logical functions with uniquely defined spatial and temporal relations. The method is designed to provide more sophisticated search options. Algorithmic and automaton models of the method have also been developed. An algorithm is presented for transforming the initial representation of the production system into a transition table of an automaton implementing the developed method of comparison with a multitude of samples. Also presented is an algorithm for converting a table view into a production automaton model. The method improves the efficiency of the computing system when implementing search procedures and processing symbol information. The proposed method can be used in systems for processing symbol information.

Keywords:  search of entry, text search, processing of character information, product approach, symbol information.

Full text (PDF):  Download

Downloads count:  222