Search software implementation of the optimal size of a string

Author: vitali lomidze
Keywords: Search, optimal, string
Annotation:

The paper suggests searching for a large size of the text optimally, which still remains an urgent problem and one of the most applicable tool to process information flow for the problems, such as searching for information. Optimal searching implies amount of time to search and provide optimality of resourses. The paper describes the implementation of a software package that is able to search a pattern in a large-sized text. The searching process is based on a programmatical implemention of two types of algorithm : The first ordinary search - looking for a specific words in the large-sized of information , exact relevance to the sentence, that implies a complete coincidence, and the second one - Semantic Search - is searching for not only the exact coincidence with the text, but also its transformation, grammatically or with the words "game" (emphasises on the content of the coincidence). Realized algorithms in the package serve one purpose to reach - to find all coincidences and / or similarities (M length) of the pattern (word / sentence is being searched for) in a large-size text, where (M <N). The application is assembled in such a way to be integrated in the form of a library both in a web application and desk programme as well, and therefore integrating programme will be able to use a variety of searching methods, which will be included in the library.