arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1606.07803cs.CY
收藏

基于CV Ria Kencana Ungu(RKU)计算机系统的Android电子服务

Penerapan E-Service Berbasis Android pada Divisi Pelayanan Perbaikan Komputer CV Ria Kencana Ungu (RKU)

Febri Valentina, Leon Andretti Abdillah, Nurul Adha Oktarini Saputri

摘要:

政府机关档案信息系统是日常工作中使用最多的应用之一。应用程序管理信息文档中的一个特性是搜索。此功能用于根据用户输入的关键字从可用信息集合中搜索文档。但一些对搜索引擎(搜索)的研究得出结论,由于多种因素,用户在搜索中的平均错误相当高。因此,我们需要开发此功能作为搜索建议。本研究探讨使用Levenshtein距离的近似字串匹配演算法的应用。Levensthein距离算法能够计算出一个字符串转换为另一个字符串的最小距离的最优值。使用Levensthein算法字符串查询信息系统是一个应用程序,将建立解决这些问题,这个应用程序将有助于,特别是在管理中输入或保存文件,定位和作出报告,将被政府机构看到。

英文摘要:

Archival information systems in government agency is one of the most used applications for daily acitivities. One feature in application management information document is searching. This feature serves to search for documents from a collection of available information based on keywords entered by the user. But some researches on a search engine (searching) concluded that the average user error in the search is quite high due to several factors. Therefore, we need a development on this feature as search suggestion. This study discusses the application of the method of approximate string matching algorithm using levenshtein distance. Levensthein distance algorithm is capable of calculating the minimum distance conversion of a string into another string to the optimum. Archiving information system using Levensthein Algorithm String is an application that will be built to address these problems, this application will help, especially in the administration to enter or save a document, locate and make a report that will be seen by government agencies.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑