<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Playing Codenames with Language Graphs and Word Embeddings · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2105.05885/</link><description>Collected HN comments and submissions linking this paper.</description><language>en</language><lastBuildDate>Mon, 02 Nov 2026 11:16:22 GMT</lastBuildDate><atom:link href="https://hackerpaper.kaipfister.de/p/2105.05885/feed.xml" rel="self" type="application/rss+xml" /><item><title>Playing Codenames with Language Graphs and Word Embeddings — HN submission</title><link>https://news.ycombinator.com/item?id=41223783</link><guid isPermaLink="false">urn:hackerpapers:submission:2105.05885:41223783</guid><pubDate>Mon, 12 Aug 2024 12:47:08 GMT</pubDate><description>&lt;p&gt;Playing Codenames with Language Graphs and Word Embeddings (2021)&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;3 points; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2105.05885/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.CL</category></item><item><title>Playing Codenames with Language Graphs and Word Embeddings — mentioned by mkaszkowiak</title><link>https://news.ycombinator.com/item?id=41223667</link><guid isPermaLink="false">urn:hackerpapers:mention:2105.05885:41223667</guid><pubDate>Mon, 12 Aug 2024 12:33:54 GMT</pubDate><description>&lt;p&gt;I&amp;#x27;ve also thought about creating a Codenames bot: what if we could use semantic similarity to batch words together? Surely, this can be done using a prebuilt embedding model and clustering! After some failed experiments - it performed worse than I thought it will - I&amp;#x27;ve googled the subject, and... it turns out there&amp;#x27;s a whole paper about ML and codenames :) https://arxiv.org/abs/2105.05885 (Playing Codenames with Language Graphs and Word Embeddings) - fun to read&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2105.05885/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CL</category></item><item><title>Playing Codenames with Language Graphs and Word Embeddings — mentioned by noxvilleza</title><link>https://news.ycombinator.com/item?id=39011701</link><guid isPermaLink="false">urn:hackerpapers:mention:2105.05885:39011701</guid><pubDate>Tue, 16 Jan 2024 10:31:19 GMT</pubDate><description>&lt;p&gt;I was playing a bit with embeddings in 2021. I&amp;#x27;d played codenames online with friends in lockdown and we often had interesting boards we&amp;#x27;d talk about, so when I saw papers like this (https://arxiv.org/abs/2105.05885) I looked into the topic. I found the suggested clues were very good, and there were some &amp;#x27;clue scoring&amp;#x27; functions which correlated with the actual best spymasters. Wasn&amp;#x27;t scientifically rigorous as OPs post, but I would say it was good.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2105.05885/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CL</category></item><item><title>Playing Codenames with Language Graphs and Word Embeddings — mentioned by compressedgas</title><link>https://news.ycombinator.com/item?id=27163348</link><guid isPermaLink="false">urn:hackerpapers:mention:2105.05885:27163348</guid><pubDate>Sat, 15 May 2021 08:02:00 GMT</pubDate><description>&lt;p&gt;https://arxiv.org/abs/2105.05885 https://github.com/divyakoyy/codenames&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2105.05885/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CL</category></item></channel></rss>
