<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Neural Speech Recognizer: Acoustic-to-Word LSTM Model for Large Vocabulary Speech Recognition · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1610.09975/</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/1610.09975/feed.xml" rel="self" type="application/rss+xml" /><item><title>Neural Speech Recognizer: Acoustic-to-Word LSTM Model for Large Vocabulary Speech Recognition — mentioned by woodson</title><link>https://news.ycombinator.com/item?id=15545400</link><guid isPermaLink="false">urn:hackerpapers:mention:1610.09975:15545400</guid><pubDate>Tue, 24 Oct 2017 21:28:33 GMT</pubDate><description>&lt;p&gt;Separating acoustic model and decoding graph search makes sense since you would need a huge amount of (correctly!) transcribed speech for training. See, for example, this paper by Google [1], where they used 125,000 hours (after filtering out the badly transcribed ones from the original 500,000 hours of transcribed speech) for training an end-to-end acoustic-to-word model. Good &amp;quot;old-school&amp;quot; DNN acoustic models can already be trained with orders of magnitude less training data (hundreds to thousands of hours). [1] https://arxiv.org/abs/1610.09975&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1610.09975/"&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>
