Show simple item record

dc.contributor.authorSutisna, Utis
dc.date.accessioned2010-07-06T03:44:54Z
dc.date.available2010-07-06T03:44:54Z
dc.date.issued2010
dc.identifier.urihttp://repository.ipb.ac.id/handle/123456789/30608
dc.description1. Implementasi algoritme Damerau Levenshtein untuk koreksi ejaan pada search engine, dapat meningkatkan kinerja temu kembali dan query menjadi lebih optimal. Ini terlihat peningkatan secara rata-rata precision sebesar 44,82 % setelah dilakukan pengoreksian. 2. Pengoreksian dengan algoritme Damerau Levenshtein lebih baik dibanding dengan metode jarak edit yang dilakukan oleh Arumsari (1998). Ini terlihat peningkatan precision pada kinerja temu kembali sebesar 22% serta kata usulan yang diperoleh dengan algoritme Damerau Levenshtein lebih optimal.id
dc.description.abstractQuery spelling on search engine is important to improve the quality information searching result. When user types query for search engine input, sometime spelling mistakes occurred due to position of keyboard and finger movement while typing. As an effect, searching result is incorrect and when user misspells the query, information obtained will not succeed. Therefore, search engine requires an application of spelling corrections. This research proposes correction process for query spelling by giving words suggestions which are obtained by calculating edit distance for each corrected word towards every word in dictionary. The concept for calculating edit distance uses Damerau Levenshtein algorithm which consists of 4 operations: (1) insertion, (2) substitution, (3) deletion, and (4) transposition. This research shows that implementation of Damerau Levenshtein algorithm is able to increase recall-precision value in information retrieval system. It is shown by the increasing of average recall-precision value at 44,82% after correction.id
dc.subjectDamerau Levenshteinid
dc.subjectAlgoritme Damerau Levenshtein Metricid
dc.subjectedit distanceid
dc.titleKoreksi Ejaan Query Bahasa Indonesia Menggunakan Algoritme Damerau Levenshteinid
dc.typeThesisid


Files in this item

Thumbnail
Thumbnail
Thumbnail
Thumbnail
Thumbnail
Thumbnail
Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record