Overview and practical implementation of fuzzy search algorithms
Andrey Leshchenko · Transaction of Scientific Papers of the Novosibirsk State Technical University · 2019
Fuzzy search and approximate search algorithms were reviewed in this article.All the fundamental definitions, that helping to better understand the concept of fuzzy search are noted below.Also was shown how to practically implement them to set up a work flow for mobile network operator.Program that have been shown in the implementation, now available via github linkhttps://github.com/JackMor/HKTgit.This program have been written by computer programmers team called "Infinite Capacity" on 2018 hackathon for Megafon, that have been placed in The library of Novosibirsk State Technical University .Wide spectrum of technology was used to create this program: JavaScript(NodeJS) for server and also fuzzy search was implemented with elasticsearch(JS framework), PostgreSQL for database management, VK BOT API and TG BOT API for the social media interaction.For better understanding of approximate search provided formal and schematic representations of the algorithm.Also you can find pseudocode explanation of Needleman-Wunsch algorithm below.Damerau-Levenshtein distance presented with the exact example of string approximate coparison.References are containing full guide to elasticsearch framework user, that might help to understand the conception of fuzzy search too.In the end of the article you can find a conclusion with the analysis of the future for approximate search algorithms.