Application of the Finite State Automata (FSA) Method in Indonesian Stemming using the Nazief & Adriani Algorithm

lady agustin fitriana, Ali Mustopa, Muhammad Rifqi Firdaus, Rizka Dahlia

Abstract


Language is a communication tool commonly used in everyday life. Each country has a different language with predetermined rules. For instance, in the Indonesian language, there are approximately 35 official affixes mentioned in the Big Indonesian Dictionary. These affixes include prefixes (prefixes), infixes (insertions), suffixes (suffixes), and confixes (a combination of prefixes and suffixes). In Information Retrieval, there is a stemming process, which is the process of converting a word form into a base word or the process of transforming variant words into their base form. The theory of language and automata is the foundation of the computer science field that provides the basis for ideas and models of computer systems. In the implementation of the research, several stages were carried out, such as explaining the Nazief & Adriani stemming algorithm, finite state automata, creating pseudocode, and testing using a web-based system, resulting in affixed words becoming the correct base words with 20 affixed words. The results obtained from reading this web-based system, the base word "cinta" (love) used as a test yielded accurate results in accordance with the concept of the Nazief & Adriani stemming algorithm. There are some weaknesses in stemming from suffixes, and the solution is to perform stemming from the prefix position (Prefix).

Full Text:

PDF

References


O. Mailani, I. Nuraeni, S. A. Syakila, dan J. Lazuardi, “Bahasa sebagai Alat Komunikasi dalam Kehidupan Manusia,” Kampret J., vol. 1, no. 1, hal. 1–10, 2022, doi: 10.35335/v1i1.8.

R. W. Eriyanti, K. T. Syarifuddin, K. Datoh, dan E. Yuliana, Linguistik Umum. Uwais Inspirasi Indonesia, 2020.

J. Jumadi, D. S. Maylawati, L. D. Pratiwi, dan M. A. Ramdhani, “Comparison of Nazief-Adriani and Paice-Husk algorithm for Indonesian text stemming process,” IOP Conf. Ser. Mater. Sci. Eng., vol. 1098, no. 3, hal. 032044, 2021, doi: 10.1088/1757-899x/1098/3/032044.

S. Huber, H. Wiemer, D. Schneider, dan S. Ihlenfeldt, “DMME: Data mining methodology for engineering applications - A holistic extension to the CRISP-DM model,” Procedia CIRP, vol. 79, hal. 403–408, 2019, doi: 10.1016/j.procir.2019.02.106.

J. Asian, H. E. Williams, dan S. M. M. Tahaghoghi, “Stemming Indonesian,” Conf. Res. Pract. Inf. Technol. Ser., vol. 38, hal. 307–314, 2019, doi: 10.1145/1316457.1316459.

W. Hidayat, E. Utami, dan A. D. Hartanto, “Effect of Stemming Nazief Adriani on the Ratcliff/Obershelp algorithm in identifying level of similarity between slang and formal words,” 2020 3rd Int. Conf. Inf. Commun. Technol. ICOIACT 2020, hal. 22–27, 2020, doi: 10.1109/ICOIACT50329.2020.9331973.

A. Yudhana, A. Fadlil, dan M. Rosidin, “Indonesian words error detection system using nazief adriani stemmer algorithm,” Int. J. Adv. Comput. Sci. Appl., vol. 10, no. 12, hal. 219–225, 2019, doi: 10.14569/ijacsa.2019.0101231.

A. Sinaga dan S. P. Nainggolan, “Analisis Perbandingan Akurasi dan Waktu Proses Algoritma Stemming Arifin-Setiono dan Nazief-Adriani pada Dokumen Teks Bahasa Indonesia,” Sebatik, vol. 27, no. 1, hal. 63–69, 2023, doi: 10.46984/sebatik.v27i1.2072.

T. Hari Wicaksono, F. Dwiki Amrizal, H. Atun Mumtahana, dan J. Setia Budi No, “Pemodelan Vending Machine dengan Metode FSA (Finite State Automata),” J. Comput. Inf. Technol., vol. 2, no. 2, hal. 66–69, 2019, [Daring]. Tersedia pada: http://e-journal.unipma.ac.id/index.php/doubleclick/article/view/3901.

A. T. Ni’mah, D. A. Suryaningrum, dan A. Z. Arifin, “Autonomy Stemmer Algorithm for Legal and Illegal Affix Detection use Finite-State Automata Method,” EPI Int. J. Eng., vol. 2, no. 1, hal. 46–55, 2019, doi: 10.25042/epi-ije.022019.09.

I. Mulyana, A. Suhendra, Ernastuti, dan W. Bheta Agus, “Development of indonesian stemming algorithms through modification of grouping, sequencing and removing of affixes based on morphophonemic,” Int. J. Recent Technol. Eng., vol. 8, no. 2 Special Issue 7, hal. 179–184, 2019, doi: 10.35940/ijrte.B1044.0782S719.

Rianto, A. B. Mutiara, E. P. Wibowo, dan P. I. Santosa, “Improving the accuracy of text classification using stemming method, a case of non-formal Indonesian conversation,” J. Big Data, vol. 8, no. 1, 2021, doi: 10.1186/s40537-021-00413-1.

D. Mustikasari, I. Widaningrum, R. Arifin, dan W. H. E. Putri, “Comparison of Effectiveness of Stemming Algorithms in Indonesian Documents,” Proc. 2nd Borobudur Int. Symp. Sci. Technol. (BIS-STE 2020), vol. 203, hal. 154–158, 2021, doi: 10.2991/aer.k.210810.025.

R. T. Rizki, Afian Syafaadi, Aris Tjahyanto, “Comparison of stemming algorithms on Indonesian text processing,” Telkomnika (Telecommunication Comput. Electron. Control., vol. 17, no. 1, hal. 95–102, 2019.

I. P. M. Wirayasa, I. M. A. Wirawan, dan I. M. A. Pradnyana, “Algoritma Bastal: Adaptasi Algoritma Nazief & Adriani untuk Stemming Teks Bahasa Bali,” J. Nas. Pendidik. Tek. Inform., vol. 8, no. 1, hal. 60, 2019, doi: 10.23887/janapati.v8i1.13500.

A. C. Herlingga, I. P. E. Prismana, D. R. Prehanto, dan D. A. Dermawan, “Algoritma Stemming Nazief & Adriani dengan Metode Cosine Similarity untuk Chatbot Telegram Terintegrasi dengan E-layanan,” J. Informatics Comput. Sci., vol. 2, no. 01, hal. 19–26, 2020, doi: 10.26740/jinacs.v2n01.p19-26.

L. A. Fitriana, A. Mustopa, M. R. Firdaus, dan R. Dahlia, “Application of the Finite State Automata (FSA) Method in Indonesian Stemming using the Nazief & Adriani Algorithm,” 2024.




DOI: https://doi.org/10.32520/stmsi.v13i3.4038

Article Metrics

Abstract view : 102 times
PDF - 25 times

Refbacks

  • There are currently no refbacks.


Creative Commons License
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.