Utilizando o algoritmo de Levenshtein e MongoDB em dados de licitações governamentais

Abstract

This work consisted in using the Levenshtein algorithm together with mongoDB database with government bidding data of state mato grosso’s municipalities. The database used is part of the Public Audit system(APLIC), granted by the Court of Auditors of the State of Mato Grosso. Medication names were extracted from the bid data sample, with the purpose of testing the spelling and grouping by similarity of these comparison with the official catalog of materials of the federal government, CATMAT. For this a scenario was proposed that made available a service, which when used, performs the due verifications and orthographic corrections through the algorithm of levenshtein, and search, through the technique of full text search, drugs that by similarity Correspond to the criterion searched. The focus of the work was focused on the analysis of Assertiveness of the Levenshtein algorithm by means of the sample tested, in order to Theoretical background, show the techniques used and the results obtained.