Little search game: term network acquisition via a human computation game

Jakub Simko, M. Tvarozek, M. Bieliková
{"title":"Little search game: term network acquisition via a human computation game","authors":"Jakub Simko, M. Tvarozek, M. Bieliková","doi":"10.1145/1995966.1995977","DOIUrl":null,"url":null,"abstract":"Semantic structures, ranging from ontologies to flat folksonomies, are widely used on the Web despite the fact that their creation in sufficient quality is often a costly task. We propose a new approach for acquiring a lightweight network of related terms via the Little Search Game - a competitive browser game in search query formulation. The format of game queries forces players to express their perception of term relatedness. The term network is aggregated using \"votes\" from multiple players playing the same problem instance. We show that nearly 91% of the relationships produced by Little Search Game are correct and also elaborate on the game's unique ability to discover term relations, that are otherwise hidden to typical corpora mining methods.","PeriodicalId":91270,"journal":{"name":"HT ... : the proceedings of the ... ACM Conference on Hypertext and Social Media. ACM Conference on Hypertext and Social Media","volume":"12 1","pages":"57-62"},"PeriodicalIF":0.0000,"publicationDate":"2011-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"27","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"HT ... : the proceedings of the ... ACM Conference on Hypertext and Social Media. ACM Conference on Hypertext and Social Media","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/1995966.1995977","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 27

Abstract

Semantic structures, ranging from ontologies to flat folksonomies, are widely used on the Web despite the fact that their creation in sufficient quality is often a costly task. We propose a new approach for acquiring a lightweight network of related terms via the Little Search Game - a competitive browser game in search query formulation. The format of game queries forces players to express their perception of term relatedness. The term network is aggregated using "votes" from multiple players playing the same problem instance. We show that nearly 91% of the relationships produced by Little Search Game are correct and also elaborate on the game's unique ability to discover term relations, that are otherwise hidden to typical corpora mining methods.
小搜索游戏:通过人工计算获取网络词汇的游戏
语义结构(从本体到扁平的大众分类法)在Web上被广泛使用,尽管以足够的质量创建它们通常是一项代价高昂的任务。我们提出了一种新的方法,通过小搜索游戏获得一个轻量级的相关术语网络-一个竞争性的浏览器游戏在搜索查询公式。游戏查询的格式迫使玩家表达他们对术语相关性的看法。术语网络使用来自多个玩家的“投票”来聚合相同的问题实例。我们发现Little Search Game产生的近91%的关系是正确的,并且还详细说明了游戏发现术语关系的独特能力,否则典型的语料库挖掘方法是隐藏的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:481959085
Book学术官方微信