Damerau Levenshtein Distance for Indonesian Spelling Correction
Abstract
Keywords
Full Text:
PDFReferences
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.
DOI: http://dx.doi.org/10.26555/jifo.v13i2.a15698
Refbacks
- There are currently no refbacks.
Copyright (c) 2020 Puji Santoso, Pundhi Yuliawati, Ridwan Shalahuddin, Aji Prasetya Wibawa
![Creative Commons License](http://i.creativecommons.org/l/by-sa/4.0/88x31.png)
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
____________________________________
JURNAL INFORMATIKA
ISSN :Â 1978-0524 (print) | 2528-6374 (online)
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.