Playing Codenames with Language Graphs and Word Embeddings

• URL: http://arxiv.org/abs/2105.05885v1
• Date: Wed, 12 May 2021 18:23:03 GMT
• Title: Playing Codenames with Language Graphs and Word Embeddings
• Authors: Divya Koyyalagunta, Anna Sun, Rachel Lea Draelos, Cynthia Rudin
• Abstract summary: We propose an algorithm that can generate Codenames clues from the language graph BabelNet. We introduce a new scoring function that measures the quality of clues. We develop BabelNet-Word Selection Framework (BabelNet-WSF) to improve BabelNet clue quality.
• Score: 21.358501003335977
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Although board games and video games have been studied for decades in artificial intelligence research, challenging word games remain relatively unexplored. Word games are not as constrained as games like chess or poker. Instead, word game strategy is defined by the players' understanding of the way words relate to each other. The word game Codenames provides a unique opportunity to investigate common sense understanding of relationships between words, an important open challenge. We propose an algorithm that can generate Codenames clues from the language graph BabelNet or from any of several embedding methods - word2vec, GloVe, fastText or BERT. We introduce a new scoring function that measures the quality of clues, and we propose a weighting term called DETECT that incorporates dictionary-based word representations and document frequency to improve clue selection. We develop BabelNet-Word Selection Framework (BabelNet-WSF) to improve BabelNet clue quality and overcome the computational barriers that previously prevented leveraging language graphs for Codenames. Extensive experiments with human evaluators demonstrate that our proposed innovations yield state-of-the-art performance, with up to 102.8% improvement in precision@2 in some cases. Overall, this work advances the formal study of word games and approaches for common sense language understanding.

Related papers

• Italian Crossword Generator: Enhancing Education through Interactive Word Puzzles [9.84767617576152]
  We develop a comprehensive system for generating and verifying crossword clues. A dataset of clue-answer pairs was compiled to fine-tune the models. For generating crossword clues from a given text, Zero/Few-shot learning techniques were used.
  arXiv  Detail & Related papers  (2023-11-27T11:17:29Z)
• Using Wordle for Learning to Design and Compare Strategies [0.685316573653194]
  We can design parameterized strategies for solving Wordle, based on probabilistic, statistical, and information-theoretical information about the games. The strategies can handle a reasonably large family of Wordle-like games both systematically and dynamically. This paper will provide the results of using two families of parameterized strategies to solve the current Wordle.
  arXiv  Detail & Related papers  (2022-04-30T14:41:25Z)
• Pretraining without Wordpieces: Learning Over a Vocabulary of Millions of Words [50.11559460111882]
  We explore the possibility of developing BERT-style pretrained model over a vocabulary of words instead of wordpieces. Results show that, compared to standard wordpiece-based BERT, WordBERT makes significant improvements on cloze test and machine reading comprehension. Since the pipeline is language-independent, we train WordBERT for Chinese language and obtain significant gains on five natural language understanding datasets.
  arXiv  Detail & Related papers  (2022-02-24T15:15:48Z)
• Finding the optimal human strategy for Wordle using maximum correct letter probabilities and reinforcement learning [0.0]
  Wordle is an online word puzzle game that gained viral popularity in January 2022. We present two different methods for choosing starting words along with a framework for discovering the optimal human strategy.
  arXiv  Detail & Related papers  (2022-02-01T17:03:26Z)
• UCPhrase: Unsupervised Context-aware Quality Phrase Tagging [63.86606855524567]
  UCPhrase is a novel unsupervised context-aware quality phrase tagger. We induce high-quality phrase spans as silver labels from consistently co-occurring word sequences. We show that our design is superior to state-of-the-art pre-trained, unsupervised, and distantly supervised methods.
  arXiv  Detail & Related papers  (2021-05-28T19:44:24Z)
• Decrypting Cryptic Crosswords: Semantically Complex Wordplay Puzzles as a Target for NLP [5.447716844779342]
  Cryptic crosswords are the dominant English-language crossword variety in the United Kingdom. We present a dataset of cryptic crossword clues that can be used as a benchmark and train a sequence-to-sequence model to solve them. We show that performance can be substantially improved using a novel curriculum learning approach.
  arXiv  Detail & Related papers  (2021-04-17T18:54:00Z)
• Deconstructing word embedding algorithms [17.797952730495453]
  We propose a retrospective on some of the most well-known word embedding algorithms. In this work, we deconstruct Word2vec, GloVe, and others, into a common form, unveiling some of the common conditions that seem to be required for making performant word embeddings.
  arXiv  Detail & Related papers  (2020-11-12T14:23:35Z)
• Deep Reinforcement Learning with Stacked Hierarchical Attention for Text-based Games [64.11746320061965]
  We study reinforcement learning for text-based games, which are interactive simulations in the context of natural language. We aim to conduct explicit reasoning with knowledge graphs for decision making, so that the actions of an agent are generated and supported by an interpretable inference procedure. We extensively evaluate our method on a number of man-made benchmark games, and the experimental results demonstrate that our method performs better than existing text-based agents.
  arXiv  Detail & Related papers  (2020-10-22T12:40:22Z)
• Interactive Fiction Game Playing as Multi-Paragraph Reading Comprehension with Reinforcement Learning [94.50608198582636]
  Interactive Fiction (IF) games with real human-written natural language texts provide a new natural evaluation for language understanding techniques. We take a novel perspective of IF game solving and re-formulate it as Multi-Passage Reading (MPRC) tasks.
  arXiv  Detail & Related papers  (2020-10-05T23:09:20Z)
• Techniques for Vocabulary Expansion in Hybrid Speech Recognition Systems [54.49880724137688]
  The problem of out of vocabulary words (OOV) is typical for any speech recognition system. One of the popular approach to cover OOVs is to use subword units rather then words. In this paper we explore different existing methods of this solution on both graph construction and search method levels.
  arXiv  Detail & Related papers  (2020-03-19T21:24:45Z)
• Learning Dynamic Belief Graphs to Generalize on Text-Based Games [55.59741414135887]
  Playing text-based games requires skills in processing natural language and sequential decision making. In this work, we investigate how an agent can plan and generalize in text-based games using graph-structured representations learned end-to-end from raw text.
  arXiv  Detail & Related papers  (2020-02-21T04:38:37Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.