<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>One Billion Word Benchmark for Measuring Progress in Statistical Language Modeling · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1312.3005/</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/1312.3005/feed.xml" rel="self" type="application/rss+xml" /><item><title>One Billion Word Benchmark for Measuring Progress in Statistical Language Modeling — mentioned by alquemist</title><link>https://news.ycombinator.com/item?id=25045683</link><guid isPermaLink="false">urn:hackerpapers:mention:1312.3005:25045683</guid><pubDate>Tue, 10 Nov 2020 13:30:47 GMT</pubDate><description>&lt;p&gt;Intelligent trial and error. 1. Transformers are an extension of the attention mechanism, a well known LSTM extension that worked well for machine translation (2014, https://arxiv.org/abs/1409.0473). A transformer model is essentially building a multi headed attention module, analogue to CNNs, then stacking several layers of them, analogue to CNNs / stacked LSTMs. (1998, http://yann.lecun.com/exdb/publis/pdf/lecun-01a.pdf) 2. Transfomers use residual blocks, which were introduced by the ResNet CNN arhitecture (2015, https://arxiv.org/abs/1512.03385). At the time, ResNet was topping the…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1312.3005/"&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>One Billion Word Benchmark for Measuring Progress in Statistical Language Modeling — mentioned by Danylon</title><link>https://news.ycombinator.com/item?id=14162887</link><guid isPermaLink="false">urn:hackerpapers:mention:1312.3005:14162887</guid><pubDate>Fri, 21 Apr 2017 03:26:33 GMT</pubDate><description>&lt;p&gt;Using an innocuous encoding of a word is a form of encryption. People who expect to be under surveillance agree on a set of code words to denote illegal things. Though hard, there are multiple ways to semi-automatically break such a linguistic encryption. Imputation. [1] Remove a word from a sentence then try to predict it from its surrounding context. &amp;quot;when I get home tonight, i vape a ___ then space out&amp;quot;. Assign predicted probabilities to imputed word &amp;quot;:leaf emoji:&amp;quot; [&amp;quot;marijuana cigarette&amp;quot;, &amp;quot;electronic cigarette&amp;quot;, &amp;quot;cigar&amp;quot;]. Active learning. Seed the algorithm with expert knowledge from law…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1312.3005/"&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>One Billion Word Benchmark for Measuring Progress in Statistical Language Modeling — HN submission</title><link>https://news.ycombinator.com/item?id=7386072</link><guid isPermaLink="false">urn:hackerpapers:submission:1312.3005:7386072</guid><pubDate>Wed, 12 Mar 2014 15:18:32 GMT</pubDate><description>&lt;p&gt;Billion Word Benchmark for Statistical Language Modeling from Google&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/1312.3005/"&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>
