Peggy, Peggy and Hansun, Seng (2015) Optimasi Pencarian Kata pada Aplikasi Penerjemah Bahasa Mandarin – Indonesia Berbasis Android dengan Algoritma Levenshtein Distance. Ultima Computing: Jurnal Sistem Komputer, 7 (1). ISSN 2549-4007
Full text not available from this repository.Abstract
In the Chinese-Indonesian language translator application on electronic device, such as Android, input is all about pinyin. Sometimes, some errors could occured. User can not find the word which he is searching for. These errors can increase the number of processing time. A solution to solve these errors is performing optimization on the application, i.e. by providing some alternative approaches word which typed by user. Application will sort alternative words according to the smallest distance to the largest distance. Then, application will display alternative words order from top priority which has the smallest distance, to low priority which has the largest distance. In brief, translator application with optimization is useful to shorten processing time of translating from Chinese to Indonesian by providing alternative words. Optimization is done with Levenshtein Distance algorithm. Levenshtein Distance algorithm will calculate the difference between the distance of the word user typed among alternative words.
| Item Type: | Article |
|---|---|
| Subjects: | 000 Computer Science, Information and General Works > 000 Computer Science, Knowledge and Systems > 005 Computer Programming |
| Divisions: | Faculty of Engineering & Informatics > Informatics |
| Depositing User: | Administrator UMN Library |
| Date Deposited: | 21 Oct 2021 03:05 |
| Last Modified: | 21 Oct 2021 03:05 |
| URI: | https://kc.umn.ac.id/id/eprint/18926 |
Actions (login required)
 |
View Item |
