![]() Levensthein distance algorithm is capable of calculating the minimum distance conversion of a string into another string to the optimum. This study discusses the application of the method of approximate string matching algorithm using levenshtein distance. ![]() Therefore, we need a development on this feature as search suggestion. But some researches on a search engine (searching) concluded that the average user error in the search is quite high due to several factors. This feature serves to search for documents from a collection of available information based on keywords entered by the user. One feature in application management information document is searching. Archival information systems in government agency is one of the most used applications for daily acitivities.
0 Comments
Leave a Reply. |