Damerau Levenshtein Distance for Indonesian Spelling Correction

Authors

  • Puji Santoso Jurusan Teknik Elektro, Program Studi Teknik Informatika, Universitas Negeri Malang
  • Pundhi Yuliawati Jurusan Teknik Elektro, Program Studi Teknik Informatika, Universitas Negeri Malang
  • Ridwan Shalahuddin Jurusan Teknik Elektro, Program Studi Teknik Informatika, Universitas Negeri Malang
  • Aji Prasetya Wibawa Jurusan Teknik Elektro, Program Studi Teknik Informatika, Universitas Negeri Malang

Keywords:

Data mining, Damerau Levenshtain Distance, Spell Checker

Abstract

Word correction used to find an incorrect word in writing. Levenshtein distance is one of algorithm to correcting typing error. It is an algorithm that calculates a difference between two strings. The operations that used to the calculation are insert, delete, and substitution. However, this algorithm has a disadvantage that it cannot overcome two switched letters in the same word. The algorithm that can solve those issues is a damerau Levenshtein. This research aims to analyse a damerau Levenshtein algorithm that used to correcting Indonesian spelling. The dataset in this research consists of two fairy tale stories with a total of 1266 words and 100 typing errors. From these two algorithms, the accuracy is up to 73% on Levenshtein distance and 75% on damerau Levenshtein.

References

Z. Su, B. Ahn, K. Eom, M. Kang, J. Kim, and M. Kim, “Plagiarism Detection Using the Levenshtein Distance and Smith-Waterman Algorithm,†pp. 0–3, 2008.

D. Nofriansyah, S. N. Arief, and B. Anwar, “Optimization of Levenshtein Technique and Intrusion Detection System Method to Overcome in the Middle Attack From Intruder on Based Network TPC/IP,†pp. 203–212, 1978.

F. Ahmad, “Learning a Spelling Error Model from Search Query Logs,†no. October, pp. 955–962, 2005.

E. Brill and R. C. Moore, “An Improved Error Model for Noisy Channel Spelling Correction,†no. Kukich 1992, 2000.

J. Jupin, J. Y. Shi, and Z. Obradovic, “Understanding Cloud Data Using Approximate String Matching and Edit Distance,†pp. 1234–1243, 2013, doi: 10.1109/SC.Companion.2012.149.

D. Q. Thang, “Determining restricted Damerau-Levenshtein edit- distance of two languages by extended automata,†2010.

R. Gabrys, E. Yaakobi, and O. Milenkovic, “Codes in the Damerau Distance for DNA Storage,†no. January, 2016.

Downloads

Published

2019-07-12

Issue

Vol. 13 No. 2 (2019): July 2019

Section

Articles

License

Authors who publish with Jurnal Informatika (JIFO) agree to the following terms:

  • Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License (CC BY-SA 4.0) that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
  • Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
  • Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work.

 

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