PERBANDINGAN ALGORITMA JARO-WINKLER DISTANCE DAN LEVENSHTEIN DISTANCE PADA SISTEM PENGOREKSI EJAAN KATA BERBAHASA INDONESIA

DESVANIA, ACHMA and Yusliani, Novi and Rodiah, Desty (2020) PERBANDINGAN ALGORITMA JARO-WINKLER DISTANCE DAN LEVENSHTEIN DISTANCE PADA SISTEM PENGOREKSI EJAAN KATA BERBAHASA INDONESIA. Undergraduate thesis, Sriwijaya University.

[thumbnail of RAMA_55201_09021181520009.pdf] Text
RAMA_55201_09021181520009.pdf - Accepted Version
Restricted to Repository staff only
Available under License Creative Commons Public Domain Dedication.

Download (2MB) | Request a copy
[thumbnail of RAMA_55201_09021181520009_TURNITIN.pdf] Text
RAMA_55201_09021181520009_TURNITIN.pdf - Accepted Version
Restricted to Repository staff only
Available under License Creative Commons Public Domain Dedication.

Download (12MB) | Request a copy
[thumbnail of RAMA_55201_09021181520009_0008118205_8802870018_01_FRONT_REF.pdf]
Preview
Text
RAMA_55201_09021181520009_0008118205_8802870018_01_FRONT_REF.pdf - Accepted Version
Available under License Creative Commons Public Domain Dedication.

Download (3MB) | Preview
[thumbnail of RAMA_55201_09021181520009_0008118205_8802870018_02.pdf] Text
RAMA_55201_09021181520009_0008118205_8802870018_02.pdf - Accepted Version
Restricted to Repository staff only
Available under License Creative Commons Public Domain Dedication.

Download (515kB) | Request a copy
[thumbnail of RAMA_55201_09021181520009_0008118205_8802870018_03.pdf] Text
RAMA_55201_09021181520009_0008118205_8802870018_03.pdf - Accepted Version
Restricted to Repository staff only
Available under License Creative Commons Public Domain Dedication.

Download (589kB) | Request a copy
[thumbnail of RAMA_55201_09021181520009_0008118205_8802870018_04.pdf] Text
RAMA_55201_09021181520009_0008118205_8802870018_04.pdf - Accepted Version
Restricted to Repository staff only
Available under License Creative Commons Public Domain Dedication.

Download (1MB) | Request a copy
[thumbnail of RAMA_55201_09021181520009_0008118205_8802870018_05.pdf] Text
RAMA_55201_09021181520009_0008118205_8802870018_05.pdf - Accepted Version
Restricted to Repository staff only
Available under License Creative Commons Public Domain Dedication.

Download (275kB) | Request a copy
[thumbnail of RAMA_55201_09021181520009_0008118205_8802870018_06_REF.pdf] Text
RAMA_55201_09021181520009_0008118205_8802870018_06_REF.pdf - Bibliography
Restricted to Repository staff only
Available under License Creative Commons Public Domain Dedication.

Download (395kB) | Request a copy
[thumbnail of RAMA_55201_09021181520009_0008118205_8802870018_07_LAMP.pdf] Text
RAMA_55201_09021181520009_0008118205_8802870018_07_LAMP.pdf - Accepted Version
Restricted to Repository staff only
Available under License Creative Commons Public Domain Dedication.

Download (285kB) | Request a copy

Abstract

Spelling is one of the most noteworthy parts of a written text. Spelling errors often encountered in sentences that affect the meaning contained and make the reader have difficulty interpreting them. Correction of spelling done manually will take a long time because the checking process repeated to obtain accurate results. A system is needed to simplify the process of correcting the spelling of wrong words. We can use several algorithms to help the system work to build. In this study, the author will compare the Levenshtein Distance and Jaro-Winkler Distance algorithm to see the best performance of the two in a spelling checker system for incorrect words. The comparison will be using the Mean Reciprocal Rank value and assisted by the N-Gram method to divide word by word into Bigram form, weighting using tf-idf, and checking the similarity between two words with Cosine Similarity. The results obtained from this study indicate that the performance of the Levenshtein Distance algorithm for the insertion error type is better compared to Jaro-Winkler Distance. Jaro-Winkler Distance performance is slightly better for the substitution and transposition error type, and for deletion, the performance of both are balanced.

Item Type: Thesis (Undergraduate)
Uncontrolled Keywords: Levenshtein Distance, Jaro-Winkler Distance, Spelling Checker, N-Gram, tf-idf, Cosine Similarity, Mean Reciprocal Rank.
Subjects: Q Science > Q Science (General) > Q334-342 Computer science. Artificial intelligence. Algorithms. Robotics. Automation.
Q Science > QA Mathematics > QA8.9-QA10.3 Computer science. Artificial intelligence. Computational complexity. Data structures (Computer scienc. Mathematical Logic and Formal Languages
Divisions: 09-Faculty of Computer Science > 55201-Informatics (S1)
Depositing User: Users 7856 not found.
Date Deposited: 07 Sep 2020 06:43
Last Modified: 07 Sep 2020 07:36
URI: http://repository.unsri.ac.id/id/eprint/34590

Actions (login required)

View Item View Item