Fuzzy search concept is realized by different algorithms, and is widely implemented in different domains of human activity. Thus, the problem of these algorithms comparison is a really relevant one. Most works in this area are made on the basis of English words and Latin alphabet. This research is oriented towards Russian words as primary data for experiments. It was revealed on the basis of experiments with Russian word data that the algorithm based on N-gram structures was the fastest one, but could deliver unreliable results.
REFERENCES
1.
C. D.
Manning
, P.
Raghavan
, H.
Schütze
, Introduction to Information Retrieval
(Williams
, 2014
).2.
SapHanaTutorial Search. What Is Fuzzy Search?
, available at: http://saphanatutorial.com/sap-hana-fuzzy-search/.3.
BusinessDictionary. Fuzzy Search
, available at: http://www.businessdictionary.com/definition/fuzzy-search.html.4.
V.I.
Levenstein
, "Binary codes with correction of losses, inserts and replacements of symbols
", Reports of Academy of Sciences of the USSR
, Vol. 163
(1965
).5.
Nikita’s Blog. Fuzzzy String Search
, available at: http://ntz-develop.blogspot.com/2011/03/fuzzy-string-search.html.6.
F.J.
Damerau
, "A technique for computer detection and correction of spelling errors
", Communications of the ACM
, 7
(3
), 171
–176
(March 1964
).7.
L. M.
Boitsov
, "Using Signature Hashing For Approximate String Matching
", Computational Mathematics and Modeling
, Vol. 13
, Issue 3
, 314
–326
(July 2002
).8.
W.A.
Burkhard
, R.M.
Keller
, "Some approaches to best-match file searching
", Communications of the ACM
, Vol. 6
, Issue 4
, 230
–236
(April 1973
).
This content is only available via PDF.
© 2019 Author(s).
2019
Author(s)
You do not currently have access to this content.