<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Enriching Word Vectors with Subword Information · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1607.04606/</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/1607.04606/feed.xml" rel="self" type="application/rss+xml" /><item><title>Enriching Word Vectors with Subword Information — mentioned by physicsyogi</title><link>https://news.ycombinator.com/item?id=16628582</link><guid isPermaLink="false">urn:hackerpapers:mention:1607.04606:16628582</guid><pubDate>Tue, 20 Mar 2018 14:00:12 GMT</pubDate><description>&lt;p&gt;Enriching Word Vectors with Subword Information: https://arxiv.org/abs/1607.04606&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1607.04606/"&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>Enriching Word Vectors with Subword Information — HN submission</title><link>https://news.ycombinator.com/item?id=14698590</link><guid isPermaLink="false">urn:hackerpapers:submission:1607.04606:14698590</guid><pubDate>Tue, 04 Jul 2017 21:59:30 GMT</pubDate><description>&lt;p&gt;Enriching Word Vectors with Subword Information [pdf]&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;1 point; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/1607.04606/"&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>Enriching Word Vectors with Subword Information — mentioned by minimaxir</title><link>https://news.ycombinator.com/item?id=12362176</link><guid isPermaLink="false">urn:hackerpapers:mention:1607.04606:12362176</guid><pubDate>Thu, 25 Aug 2016 20:22:52 GMT</pubDate><description>&lt;p&gt;This was posted in 2015, but now that fasttext (https://github.com/facebookresearch/fastText), just released by Facebook and can scale to Instagram-sized datasets, can create word vectors better than word2vec which account for context (https://arxiv.org/pdf/1607.04606v1.pdf), this type of analysis will only improve in the future.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1607.04606/"&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>Enriching Word Vectors with Subword Information — mentioned by kough</title><link>https://news.ycombinator.com/item?id=12228216</link><guid isPermaLink="false">urn:hackerpapers:mention:1607.04606:12228216</guid><pubDate>Thu, 04 Aug 2016 20:29:27 GMT</pubDate><description>&lt;p&gt;Links to the relevant papers: Bag of Tricks for Efficient Text Classification: https://arxiv.org/abs/1607.01759v2 Enriching Word Vectors with Subword Information: https://arxiv.org/abs/1607.04606 Both fantastic papers. For those who aren&amp;#x27;t aware, Mikolov also helped create word2vec. One curious thing: this seems to use heirarchal softmax instead of the &amp;quot;negative sampling&amp;quot; described in their earlier paper http://arxiv.org/abs/1310.4546, despite that paper reporting that &amp;quot;negative sampling&amp;quot; is more computationally efficient and of similar quality. Anyone know why that might be?&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1607.04606/"&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>
