
Optimasi Pencarian Kata pada Aplikasi Penerjemah Bahasa Mandarin – Indonesia Berbasis Android dengan Algoritma Levenshtein Distance
Author(s) -
Peggy Peggy,
Seng Hansun
Publication year - 2016
Publication title -
ultima computing/ultima computing: jurnal sistem komputer
Language(s) - English
Resource type - Journals
eISSN - 2549-4007
pISSN - 2355-3286
DOI - 10.31937/sk.v7i1.449
Subject(s) - levenshtein distance , edit distance , computer science , pinyin , android (operating system) , word (group theory) , arithmetic , natural language processing , artificial intelligence , chinese characters , mathematics , operating system , geometry
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.
Index Terms─Android, Chinese, Indonesian, Levenshtein Distance, optimization, translator application