<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Subword Regularization: Improving Neural Network Translation Models with Multiple Subword Candidates · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1804.10959/</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/1804.10959/feed.xml" rel="self" type="application/rss+xml" /><item><title>Subword Regularization: Improving Neural Network Translation Models with Multiple Subword Candidates — mentioned by mcyc</title><link>https://news.ycombinator.com/item?id=44135801</link><guid isPermaLink="false">urn:hackerpapers:mention:1804.10959:44135801</guid><pubDate>Fri, 30 May 2025 13:01:09 GMT</pubDate><description>&lt;p&gt;Just a minor nit: SentencePiece is a library, not a tokenization algorithm. It implements two tokenization algorithms, Unigram and BPE. BPE builds vocabularies from the base up so I assume you are talking about Unigram which starts with a big vocabulary and trims it. The details of UnigramLM are here https://arxiv.org/pdf/1804.10959, and the part about vocabulary seeding is Section 3.2. Basically, it just selects all substrings that appear in the corpus up to a certain length (and then maybe trims it a little by discarding rare substrings or something to reduce the initial size a bit and make…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1804.10959/"&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>Subword Regularization: Improving Neural Network Translation Models with Multiple Subword Candidates — mentioned by jszymborski</title><link>https://news.ycombinator.com/item?id=39416601</link><guid isPermaLink="false">urn:hackerpapers:mention:1804.10959:39416601</guid><pubDate>Sun, 18 Feb 2024 06:01:36 GMT</pubDate><description>&lt;p&gt;Also very neat is the Unigram algorithm. IIRC that paper also introduces subword regularization which I think is really cool. https://arxiv.org/abs/1804.10959&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1804.10959/"&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>Subword Regularization: Improving Neural Network Translation Models with Multiple Subword Candidates — HN submission</title><link>https://news.ycombinator.com/item?id=16985241</link><guid isPermaLink="false">urn:hackerpapers:submission:1804.10959:16985241</guid><pubDate>Thu, 03 May 2018 12:15:07 GMT</pubDate><description>&lt;p&gt;Subword Regularization: Improving Neural Network Translation Models&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/1804.10959/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.CL</category></item></channel></rss>
