An application of Malay short-form word conversion using Levenshtein Distance

An application of Malay short-form word conversion using Levenshtein Distance. Mathematical Sciences and Informatics Journal (MIJ), 1 (2). pp. 34-42. ISSN 2735-0703 (2020)


Formerly, short-form word was widely used in the field of journalism. However, nowadays, short-form word has been widely used by many people, especially in online communication. These short-form words trigger problems in the field of data mining, especially those involving online text processing. It leads to inaccurate result of text mining activities. On the other hand, only few works have investigated on Malay short-form word identification and conversion. Therefore, this work aims to develop an application that can identify and convert Malay short-form words into its’ full word. In order to develop this application, the short-form rules need to be carefully examined. The formal rules from Dewan Bahasa & Pustaka (DBP) are used as the primary reference for generating the short form word identification algorithm. While for the conversion algorithm, Levenshtein Distance (LD) is used to measure the similarity. The rule-based technique is also used as a complement to LD technique. As a result, 70.27% of the Malay short-form words have been correctly converted into their full words. The conversion rate is quite promising, and this work can be further strengthened by incorporating more rules into the algorithm.

Item Type: Article
Keywords: Malay short form word, Noisy text normalization, Levenshtein Distance, Rule-based, Application
Taxonomy: By Subject > Computer & Mathematical Sciences > Computer Science
By Subject > Computer & Mathematical Sciences > Information Technology
Local Content Hub: Subjects > Computer and Mathematical Sciences
Depositing User: Nur Aida Rousli
Date Deposited: 01 Oct 2021 22:40
Last Modified: 01 Oct 2021 22:40
Related URLs:

Actions (login required)

View Item View Item