نتایج جستجو برای: word games

تعداد نتایج: 160429  

Journal: :Proceedings of the ... AAAI Conference on Artificial Intelligence 2021

We study the problem of adversarial language games, in which multiple agents with conflicting goals compete each other via natural interactions. While games are ubiquitous human activities, little attention has been devoted to this field processing. In work, we propose a challenging game called Adversarial Taboo as an example, attacker and defender around target word. The is tasked inducing utt...

2008
David Vickrey Aaron Bronzan William Choi Aman Kumar Jason Turner-Maier Arthur Wang Daphne Koller

Obtaining labeled data is a significant obstacle for many NLP tasks. Recently, online games have been proposed as a new way of obtaining labeled data; games attract users by being fun to play. In this paper, we consider the application of this idea to collecting semantic relations between words, such as hypernym/hyponym relationships. We built three online games, inspired by the real-life games...

2011
Anuj Kumar Pooja Reddy Matthew Kam

In this study, we designed and developed two educational games on mobile phones with support for speech-recognition to examine and train the cognitive underpinnings of word reading in English as a Second Language (ESL) learners in rural India. Specifically, we tested the hypothesis that articulating a word aloud will be more advantageous for strengthening the sublexical components required for ...

2017
Björn Strååt Harko Verhagen

This paper presents a method for gathering and evaluating user attitudes towards previously released video games. All user reviews from two video game franchise were collected. The most frequently mentioned words of the games were derived from this dataset through word frequency analysis. The words, called “aspects” were then further analyzed through a manual aspect based sentiment analysis. Th...

Journal: :IJGBL 2012
Payal Arora Sorina Itu

The battle between educators and entertainers continue when it comes to gaming. While this is so, the edutainment battleground has expanded to include actors outside formal schooling agencies, namely International Non-Governmental Organizations (INGOs). These actors employ digital games with the aim to educate and activate towards specific social causes. These serious games are viewed to have t...

Journal: :TACL 2014
David Jurgens Roberto Navigli

Annotated data is prerequisite for many NLP applications. Acquiring large-scale annotated corpora is a major bottleneck, requiring significant time and resources. Recent work has proposed turning annotation into a game to increase its appeal and lower its cost; however, current games are largely text-based and closely resemble traditional annotation tasks. We propose a new linguistic annotation...

2015
Aviezri S. Fraenkel Michel Rigo

For fusing combinatorial game theory with combinatorics on words, we begin with some relevant background on words and automata theory, followed by devising and analyzing a triple of games derived from a generalization of the Thue-Morse word.

2013
Huan-Bo Luan Dejun Hou Tat-Seng Chua

This demonstration presents a live observatory system named ‘NExTLive’. It aims to analyze live online social media data to mine social phenomena, senses, influences and geographic trends dynamically. It builds an efficient and robust set of crawlers to continually crawl online social interactions on various social networking sites, covering contents from different facets and in different mediu...

Journal: :Inf. Process. Lett. 2009
Gillat Kol Ran Raz

We study Locally Testable Codes (LTCs) that can be tested by making two queries to the tested word using an a ne test. That is, we consider LTCs over a nite eld F, with codeword testers that only use tests of the form avi + bvj = c, where v is the tested word and a, b, c ∈ F. We show that such LTCs, with high minimal distance, must be of constant size. Speci cally, we show that every 2-query LT...

2009
Gillat Kol Ran Raz

We study Locally Testable Codes (LTCs) that can be tested by making two queries to the tested word using an a ne test. That is, we consider LTCs over a nite eld F, with codeword testers that only use tests of the form avi + bvj = c, where v is the tested word and a, b, c ∈ F. We show that such LTCs, with high minimal distance, must be of constant size. Speci cally, we show that every 2-query LT...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید