Mixed Heuristic Algorithm As String Matching For Search Document

Abstract

The computer provides document search based on the document file title. So this makes it difficult for users to find documents, if the user forgets the file title of the document. String matching algorithm is the basic component for data searching. Search engine requires an algorithm that can work quickly and can sort the documents according to the level of compatibility. One of the algorithms that match is the Mixed Heuristic. These algorithms perform a search pattern or query not just against a word, but can be a sentence of more than one word. In addition, these algorithms also perform ranking of relevant documents. This paper shows the analysis of the level of accuracy using precision and recall of the results given by search engines by using the Mixed Heuristic algorithms for string matching, and the analysis of documents from the results given by search engines.