文章基本信息

标题：Implementation of Levenshtein Distance Algorithm for ECommerce of Bravoisitees Distro
本地全文：下载
作者：Rusydi Umar ; Yana Hendriana ; Eko Budiyono 等
期刊名称：International Journal of Computer Trends and Technology
电子版ISSN：2231-2803
出版年度：2015
卷号：27
期号：3
页码：131-136
DOI：10.14445/22312803/IJCTT-V27P123
出版社：Seventh Sense Research Group
摘要：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 KnuthMorrisPratt, BoyerMoore, RabinKarp, and others. While specific search string is that the Levenshtein Distance Algorithm approach for ECommerce of Bravoisitees Distro. Results from this study is an ecommece 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.
关键词：Search; Expression; Search Engine; LevenshteinDistance Algorithm.