TL;DR
This paper introduces a novel algorithm for generating Codenames clues using language graphs and embeddings, incorporating a new scoring function and weighting term, achieving state-of-the-art performance in clue quality.
Contribution
The paper presents a new framework combining language graphs and embeddings for Codenames clue generation, with innovative scoring and weighting methods that enhance clue relevance and quality.
Findings
Achieved up to 102.8% improvement in precision@2
Demonstrated state-of-the-art performance with human evaluators
Developed BabelNet-Word Selection Framework (BabelNet-WSF)
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
MethodsAttention Is All You Need · Linear Layer · Linear Warmup With Linear Decay · Layer Normalization · Softmax · Multi-Head Attention · Residual Connection · WordPiece · Weight Decay · Attention Dropout
