Greedy-Algorithm of KSORD Supporting Multi-language Phrase Recognition

Peng Li, Qing Zhu, Chao Tian, Shan Wang
{"title":"Greedy-Algorithm of KSORD Supporting Multi-language Phrase Recognition","authors":"Peng Li, Qing Zhu, Chao Tian, Shan Wang","doi":"10.1109/ICACTE.2008.38","DOIUrl":null,"url":null,"abstract":"With the rapid development of information retrieval technology and daily increasing information in the Internet, common users can retrieve many text-based database and get part of the information through the search engines such as Google, and Baidu. However, there is a great amount of data contained in the background relational database of web pages. So there are many researches focusing on the search in these relational database with keywords, compared with these researches, our algorithms are mainly based on bags using the greedy algorithms and supporting the phrase recognition by utilizing multiple dictionaries. We make a comparison between our algorithm and the existing ones. The experiment results shows that our algorithm owns not only the feature of effectiveness but also the feature of efficiency.","PeriodicalId":364568,"journal":{"name":"2008 International Conference on Advanced Computer Theory and Engineering","volume":"42 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-12-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 International Conference on Advanced Computer Theory and Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICACTE.2008.38","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

With the rapid development of information retrieval technology and daily increasing information in the Internet, common users can retrieve many text-based database and get part of the information through the search engines such as Google, and Baidu. However, there is a great amount of data contained in the background relational database of web pages. So there are many researches focusing on the search in these relational database with keywords, compared with these researches, our algorithms are mainly based on bags using the greedy algorithms and supporting the phrase recognition by utilizing multiple dictionaries. We make a comparison between our algorithm and the existing ones. The experiment results shows that our algorithm owns not only the feature of effectiveness but also the feature of efficiency.
支持多语言短语识别的KSORD贪婪算法
随着信息检索技术的飞速发展和互联网信息量的日益增加,普通用户可以检索到许多基于文本的数据库,并通过Google、百度等搜索引擎获取部分信息。然而,网页的后台关系数据库中包含了大量的数据。因此有很多研究都集中在这些关系数据库中的关键词搜索上,与这些研究相比,我们的算法主要是基于贪心算法的bag,支持多词典的短语识别。我们将我们的算法与现有的算法进行了比较。实验结果表明,该算法不仅具有有效性,而且具有高效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信