Implementation of an index optimize technology for highly specialized terms based on the phonetic algorithm Metaphone

Buriachok, Volodymyr and Hadzhyiev, M. and Sokolov, V. Y. and Skladannyi, Pavlo and Kuzmenko, L. (2019) Implementation of an index optimize technology for highly specialized terms based on the phonetic algorithm Metaphone Eastern-European Journal of Enterprise Technologies, 5 (2(101)). pp. 64-71. ISSN 1729-4061

[thumbnail of V_Buriachok_M_Hadzhyiev_V_Sokolov_P_Skladannyi_L_Kuzmenko_EEJoET_101.pdf]
Preview
Text
V_Buriachok_M_Hadzhyiev_V_Sokolov_P_Skladannyi_L_Kuzmenko_EEJoET_101.pdf

Download (535kB) | Preview

Abstract

When compiling databases, for example to meet the needs of healthcare establishments, there is quite a common problem with the introduction and further processing of names and surnames of doctors and patients that are highly specialized both in terms of pronunciation and writing. This is because names and surnames of people cannot be unique, their notation is not subject to any rules of phonetics, while their length in different languages may not match. With the advent of the Internet, this situation has become generally critical and can lead to that multiple copies of e-mails are sent to one address. It is possible to solve the specified problem by using phonetic algorithms for comparing words Daitch-Mokotoff, Soundex, NYSIIS, Polyphone, and Metaphone, as well as the Levenshtein and Jaro algorithms, Q-gram-based algorithms, which make it possible to find distances between words. The most widespread among them are the Soundex and Metaphone algorithms, which are designed to index the words based on their sound, taking into consideration the rules of pronunciation. By applying the Metaphone algorithm, an attempt has been made to optimize the phonetic search processes for tasks of fuzzy coincidence, for example, at data deduplication in various databases and registries, in order to reduce the number of errors of incorrect input of surnames. An analysis of the most common surnames reveals that some of them are of the Ukrainian or Russian origin. At the same time, the rules following which the names are pronounced and written, for example in Ukrainian, differ radically from basic algorithms for English and differ quite significantly for the Russian language. That is why a phonetic algorithm should take into consideration first of all the peculiarities in the formation of Ukrainian surnames, which is of special relevance now. The paper reports results from an experiment to generate phonetic indexes, as well as results of the increased performance when using the formed indexes. A method for adapting the search for other areas and several related languages is presented separately using an example of search for medical preparations.

Item Type: Article
Additional Information: DOI: 10.15587/1729-4061.2019.181943 EID: 2-s2.0-85075389262 arXiv: 1911.00152
Uncontrolled Keywords: fuzzy match; phonetic rule; phonetic algorithm; Metaphone; Ukrainian surname
Subjects: Це архівна тематика Київського університету імені Бориса Грінченка > Статті у наукометричних базах > Scopus
Це архівна тематика Київського університету імені Бориса Грінченка > Статті у журналах > Фахові (входять до переліку фахових, затверджений МОН)
Divisions: Це архівні підрозділи Київського університету імені Бориса Грінченка > Факультет інформаційних технологій та математики > Кафедра інформаційної та кібернетичної безпеки імені професора Володимира Бурячка
Depositing User: Volodymyr Sokolov
Date Deposited: 03 Dec 2019 13:53
Last Modified: 03 Dec 2019 13:53
URI: https://elibrary.kubg.edu.ua/id/eprint/29410

Actions (login required)

View Item View Item