Hijriani, Astria and Sakethi, Dwi and Pandu, Rian (2014) Parsing Data Text dengan N-Gram Similarity dan Algoritma Brute Force pada Studi Kasus Verifikasi Transkrip Mata Kuliah. Journal Science East Borneo, 2 (4). pp. 228-233. ISSN 2338-7629

Preview

Text Jurnal Science East Borneo.pdf - Published Version Download (3MB) | Preview

Abstract

In this research, the development of verification systems courses is used as a study case. It aims to accelerate the process of checking the existing curriculum in computer science majors. Course verification systems was developed with the search string matching method which has two parts programming methods: exact matching and heuristic matching. Exact matching programming method using a brute force algorithm has shortcomings because it does not have the preprocessing phase. Meanwhile, heuristic matching algorithm using n-gram similarity as it can check the detail . The results shows brute-force algorithm more quickly in running time results. But n-gram similarity algorithm is more efficient in checking if there some difference in one or more character in course code and course name

Item Type:	Article
Subjects:	Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Divisions:	Fakultas Matematika dan Ilmu Pengetahuan Alam (FMIPA) > Prodi Ilmu Komputer
Depositing User:	Astria Hijriani
Date Deposited:	31 Jul 2017 07:36
Last Modified:	31 Jul 2017 07:36
URI:	http://repository.lppm.unila.ac.id/id/eprint/3721

Actions (login required)

View Item