Utilização da Distância de Levenshtein na Aproximação de Palavras em Integrações de Sistemas

Authors

  • Allan Fernando Oliveira de Andrade IFPR - Campus Paranavaí Author
  • Adrieli Kethin Santos IFPR - Campus Paranavaí Author
  • Frank Willian Cardoso de Oliveira IFPR - Campus Paranavaí Author
  • Marcelo Figueiredo Terenciani IFPR - Campus Paranavaí Author

Keywords:

Distância de Levenshtein, Aproximação de Palavras, Integrações de Sistemas

Abstract

This article explores the mathematics behind the Levenshtein distance, used method for calculating similarity between words, and its application in system integration. We use this method to compare course name entries from external systems and avoid the reinsertion of duplicate records, proposing an approach that improves data integration consistency, efficiency, and storage savings, as well as standardizing the information.

References

Charras, C. and Lecroq, T. (2004). Handbook of Exact String Matching Algorithms. Accessed: 2024-11-02.

de Andrade, A. F. O. and Terenciani, M. F. (2024). Sistema de gerenciamento de armários. Accessed: 2024-11-02.

IFPR - Campus Paranavaı́ (2024). Cronos - sistema de gerenciamento das atividades complementares. Accessed: 2024-11-02.

Lcvenshtcin, V. (1966). Binary coors capable or ‘correcting deletions, insertions, and reversals.

In Soviet Physics-Doklady, volume 10, número 8. Nair, R. (2015). fast-levenshtein: Levenshtein algorithm in javascript. https://www. npmjs.com/package/fast-levenshtein. Accessed: 2024-11-02.

OpenAI (2023). Chatgpt. A conversational AI model by OpenAI.

Published

2024-12-01

How to Cite

Utilização da Distância de Levenshtein na Aproximação de Palavras em Integrações de Sistemas. (2024). Information Technology Week, 1(1). https://tecnoif.com.br/periodicos/index.php/setif/article/view/227

Similar Articles

1-10 of 90

You may also start an advanced similarity search for this article.

Most read articles by the same author(s)

1 2 > >>