PENERAPAN ALGORITMA LEVENSHTEIN DISTANCE DALAM APLIKASI PENGOLAHAN SURAT

  • Isbalaikana Larasati Fakultas Teknik, Teknik Informatika, Universitas Widyagama Malang
  • Fitri Marisa Fakultas Teknik, Teknik Informatika, Universitas Widyagama Malang

Abstrak

The application of a letter processing system is expected to provide an advantage for a company. In designing a letter processing application, you can use the Levenshtein Distance method, where two strings of Levenshtein distance are the minimum number of operations needed to convert a string to another string. Levenshtein distance is also used to measure the value of similarity or similarity between two words (strings). So that it can simplify the process of finding mail archives. An example of the word used is sirat as the source word and letter as the target word, selling as the source word and submission as the target word, trading as the source and travel word as the target word. The results of the comparison of the word sirat and letters get the results of the distance comparison 1. While the word sales and submission has a distance comparison result 4. And in the word trade and travel has a distance comparison result 3. Keywords: Information Systems, Letter Archiving, Levenshtein Distance Algorithms

Referensi

Adriyani, N. M. M., Santiasa, I. W. & Muliantara, A., N.D. Implementasi Algoritma Levenshtein Distance Dan Metode Empiris Untuk Menampilkan Saran Perbaikan Kesalahan Pengetikan Dokumen Berbahasa Indonesia.

Ilmy, M. B., Rahmi, N. & Bu'ulolo, R. L., N.D. Penerapan Algoritma Levenshtein Distance Untuk Mengoreksi Kesalahan Pengejaan Pada Editor Teks.

Jogianto, 2008. Terstruktur Teori Dan Praktek Aplikasi Bisnis. Analisis Dan Desain Sistem Informasi.

Kadir, A., 2014. Pengenalan Sistem Informasi Dan Revisi.

Luqman, M., 2013. Pembangunan Sistem Informasi Manajemen Surat Masuk Dan Surat Keluar Pada Bagian Umum Sekretariat Daerah Kabupaten Pacitan. Sentra Penelitian Engineering Dan Edukasi, Volume 5, P. 22.

Diterbitkan
2019-07-30