Perbandingan performa algoritma nazief-adriani, successor variety metode cutoff dan n-gram termodifikasi dalam stemming dokumen

Hartono, Hadi (2015) Perbandingan performa algoritma nazief-adriani, successor variety metode cutoff dan n-gram termodifikasi dalam stemming dokumen. Bachelor Thesis thesis, Universitas Multimedia Nusantara.

[img]
Preview
Text
HALAMAN AWAL.pdf
Available under License Creative Commons Attribution Non-commercial Share Alike.

Download (876kB) | Preview
[img]
Preview
Text
BAB I.pdf
Available under License Creative Commons Attribution Non-commercial Share Alike.

Download (771kB) | Preview
[img]
Preview
Text
BAB II.pdf
Available under License Creative Commons Attribution Non-commercial Share Alike.

Download (1MB) | Preview
[img]
Preview
Text
BAB III.pdf
Available under License Creative Commons Attribution Non-commercial Share Alike.

Download (1MB) | Preview
[img] Text
BAB IV.pdf
Restricted to Registered users only
Available under License Creative Commons Attribution Non-commercial Share Alike.

Download (1MB)
[img]
Preview
Text
BAB V.pdf
Available under License Creative Commons Attribution Non-commercial Share Alike.

Download (836kB) | Preview
[img]
Preview
Text
DAFTAR PUSTAKA.pdf
Available under License Creative Commons Attribution Non-commercial Share Alike.

Download (856kB) | Preview
[img] Text
LAMPIRAN.pdf
Restricted to Registered users only
Available under License Creative Commons Attribution Non-commercial Share Alike.

Download (853kB)

Abstract

Skripsi ini memaparkan perbandingan antara tiga jenis algoritma stemming, yaitu algoritma Nazief-Adriani, Successor Variety metode Cutoff, dan N-gram dalam stemming dokumen, khususnya dokumen berbahasa Indonesia. Algoritma-algoritma tersebut digunakan untuk mendapatkan stem (kata dasar) dari kata-kata yang diproses dimana stem tersebut dapat digunakan untuk meningkatkan performa dalam proses temu kembali informasi. Parameter pengujian menggunakan dua parameter dari metode evaluasi Paice, yaitu Understemming Index (UI) dan Overstemming Index (OI), dimana makin mendekati nilai nol, makin tinggi pula tingkat akurasi stem yang dihasilkan. Pengujian terhadap lima dokumen berbeda menyimpulkan algoritma Nazief-Adriani adalah algoritma dengan tingkat akurasi paling tinggi di antara ketiga algoritma yang diujikan dalam stemming dokumen berbahasa Indonesia. Kata kunci : Cutoff, Nazief-Adriani, N-gram, Paice, stemming, Successor Variety.

Item Type: Thesis (Bachelor Thesis)
Subjects: 000 Computer Science, Information and General Works > 000 Computer Science, Knowledge and Systems > 004 Computer Science, Data Processing, Hardware
000 Computer Science, Information and General Works > 000 Computer Science, Knowledge and Systems > 005 Computer Programming > 005.2 Programming for Specific Computers, Algorithm, HTML, PHP, java, C++
Divisions: Faculty of Engineering & Informatics > Informatics
Depositing User: mr admin umn
Date Deposited: 28 Jul 2017 08:21
Last Modified: 21 Jan 2022 07:19
URI: https://kc.umn.ac.id/id/eprint/1675

Actions (login required)

View Item View Item