<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Breaking Sticks and Ambiguities with Adaptive Skip-gram · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1502.07257/</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/1502.07257/feed.xml" rel="self" type="application/rss+xml" /><item><title>Breaking Sticks and Ambiguities with Adaptive Skip-gram — mentioned by benten10</title><link>https://news.ycombinator.com/item?id=10614314</link><guid isPermaLink="false">urn:hackerpapers:mention:1502.07257:10614314</guid><pubDate>Mon, 23 Nov 2015 13:03:15 GMT</pubDate><description>&lt;p&gt;Since this appears to be the &amp;#x27;related works&amp;#x27; thread, I&amp;#x27;ll add my links here. A reasonable amount of work has already been done in disambiguation of the meanings of words with word embeddings, some of it trained, some untrained. These particular papers that have recently caught my attention, and have the potential to bring significant gains wrt existing technologies are these: 1. Infinite-Length Word embeddings http://arxiv.org/pdf/1511.05392v2.pdf I am particularly excited about this paper, as the authors suggest a method to create variable-length word vectors, depending on the multiplicity…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1502.07257/"&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>
