Peer Review : Implementasi Algoritma Jarak Levenshtein untuk ECommerce Distro Bravoisitees

Umar, Rusydi and Hendriana, Yana and Budiyono, Eko (2015) Peer Review : Implementasi Algoritma Jarak Levenshtein untuk ECommerce Distro Bravoisitees. Seventh Sense Research Group TM.

Text Peer-review- Yana-IJCTT.pdf Download (261kB)

Abstract

The search engine is a computer program designed to find the information sought from the amount of information that is available. By typing the word you want to search on the search engines then all the desired information is displayed. To search the possibility that the desired word, an approach requires the specific string search. In search of regular expressions, the exact search, there are various algorithms which are well known as the Knuth-Morris-Pratt, Boyer-Moore, Rabin-Karp, and others. While specific search string is that the Levenshtein Distance Algorithm approach for E-Commerce of Bravoisitees Distro. Results from this study is an e-commece web application that has its own search engine in the system. Using Levenshtein Distance algorithm, it can be performed a more accurate, even if the word is entered has a typing error then this algorithm can still find the desired data and provide search suggestions approaching from the word input

Item Type:	Other
Uncontrolled Keywords:	- Search, Expression, Search Engine, Levenshtein Distance Algorithm
Subjects:	H Social Sciences > HF Commerce T Technology > T Technology (General)
Divisions:	Faculty of Engineering, Science and Mathematics > School of Civil Engineering and the Environment
Depositing User:	Tri Yuliani
Date Deposited:	05 Jan 2023 07:07
Last Modified:	05 Jan 2023 07:07
URI:	http://repository.unu-jogja.ac.id/id/eprint/315

Actions (login required)

View Item