基于短信的上下文网络搜索

Jay Chen, Brenda Linn, L. Subramanian
{"title":"基于短信的上下文网络搜索","authors":"Jay Chen, Brenda Linn, L. Subramanian","doi":"10.1145/1592606.1592611","DOIUrl":null,"url":null,"abstract":"SMS-based web search is different from traditional web search in that the final response to a search query is limited to a very small number of bytes (typically 1-2 SMS messages, 140 bytes each). SMS-based web search is also a non-interactive search problem where the user has to specify a query and obtain a response in one round of search. Enabling search with with such constraints is challenging. Several search engines have developed SMS-based search capabilities in recent years and many of these search engines are limited in their recognized topics (phone, address, location, weather etc.), involve a human in the loop or apply to only specific types of search queries. We describe a simple generic approach to extracting results for both well-known and arbitrary topics. We have implemented our prototype system SMSFind and demonstrate the effectiveness of our approach. While the underlying mechanisms we present are by no means perfect, we show that our system returns appropriate responses for a range of topics not covered by existing systems.","PeriodicalId":219018,"journal":{"name":"Networking, Systems, and Applications for Mobile Handhelds","volume":"13 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"21","resultStr":"{\"title\":\"SMS-based contextual web search\",\"authors\":\"Jay Chen, Brenda Linn, L. Subramanian\",\"doi\":\"10.1145/1592606.1592611\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"SMS-based web search is different from traditional web search in that the final response to a search query is limited to a very small number of bytes (typically 1-2 SMS messages, 140 bytes each). SMS-based web search is also a non-interactive search problem where the user has to specify a query and obtain a response in one round of search. Enabling search with with such constraints is challenging. Several search engines have developed SMS-based search capabilities in recent years and many of these search engines are limited in their recognized topics (phone, address, location, weather etc.), involve a human in the loop or apply to only specific types of search queries. We describe a simple generic approach to extracting results for both well-known and arbitrary topics. We have implemented our prototype system SMSFind and demonstrate the effectiveness of our approach. While the underlying mechanisms we present are by no means perfect, we show that our system returns appropriate responses for a range of topics not covered by existing systems.\",\"PeriodicalId\":219018,\"journal\":{\"name\":\"Networking, Systems, and Applications for Mobile Handhelds\",\"volume\":\"13 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-08-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"21\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Networking, Systems, and Applications for Mobile Handhelds\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/1592606.1592611\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Networking, Systems, and Applications for Mobile Handhelds","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/1592606.1592611","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 21

摘要

基于短信的网络搜索不同于传统的网络搜索,因为对搜索查询的最终响应被限制在非常小的字节数(通常是1-2条短信,每条140字节)。基于短信的网络搜索也是一个非交互式搜索问题,用户必须在一轮搜索中指定查询并获得响应。在这样的约束条件下启用搜索是一项挑战。近年来,一些搜索引擎已经开发了基于短信的搜索功能,但其中许多搜索引擎在可识别的主题(电话、地址、位置、天气等)上受到限制,需要人工参与,或者只适用于特定类型的搜索查询。我们描述了一种简单的通用方法来提取已知和任意主题的结果。我们已经实现了我们的原型系统SMSFind,并证明了我们方法的有效性。虽然我们提供的底层机制绝不是完美的,但我们展示了我们的系统为现有系统未涵盖的一系列主题返回适当的响应。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
SMS-based contextual web search
SMS-based web search is different from traditional web search in that the final response to a search query is limited to a very small number of bytes (typically 1-2 SMS messages, 140 bytes each). SMS-based web search is also a non-interactive search problem where the user has to specify a query and obtain a response in one round of search. Enabling search with with such constraints is challenging. Several search engines have developed SMS-based search capabilities in recent years and many of these search engines are limited in their recognized topics (phone, address, location, weather etc.), involve a human in the loop or apply to only specific types of search queries. We describe a simple generic approach to extracting results for both well-known and arbitrary topics. We have implemented our prototype system SMSFind and demonstrate the effectiveness of our approach. While the underlying mechanisms we present are by no means perfect, we show that our system returns appropriate responses for a range of topics not covered by existing systems.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信