Article Per Year (5 Year)
p-Index From 2019 - 2024
0.23
P-Index
This Author published in this journals
All Journal DINAMIKA DOTCOM
Larasati, Isbalaikana
Fakultas Teknik, Teknik Informatika, Universitas Widyagama Malang
Computer Science & IT Decision Sciences, Operations Research & Management

Published : 1 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 1 Documents
Search

 1 
PENERAPAN ALGORITMA LEVENSHTEIN DISTANCE DALAM APLIKASI PENGOLAHAN SURAT Larasati, Isbalaikana; Marisa, Fitri
DINAMIKA DOTCOM DINAMIKA DOTCOM VOL 10 NO 2 TAHUN 2019
Publisher : DINAMIKA DOTCOM

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

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
Co-Authors Fitri Marisa