<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>TEVR: Improving Speech Recognition by Token Entropy Variance Reduction · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2206.12693/</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/2206.12693/feed.xml" rel="self" type="application/rss+xml" /><item><title>TEVR: Improving Speech Recognition by Token Entropy Variance Reduction — mentioned by fxtentacle</title><link>https://news.ycombinator.com/item?id=48501730</link><guid isPermaLink="false">urn:hackerpapers:mention:2206.12693:48501730</guid><pubDate>Fri, 12 Jun 2026 09:13:55 GMT</pubDate><description>&lt;p&gt;This is an interesting approach with integer programming and then using an explicit solver. It’s probably very slow, but you only have to run this once and it produces the mathematically perfect result. In the past, I got good results with trying to reduce the variance in entropy in-between tokens, which you can implement very easily by starting with each single character as its own token and then doing a greedy merge of the most numerous outlier token pairs in a loop until you reach your desired token count. https://arxiv.org/abs/2206.12693&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2206.12693/"&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>TEVR: Improving Speech Recognition by Token Entropy Variance Reduction — mentioned by fxtentacle</title><link>https://news.ycombinator.com/item?id=45642910</link><guid isPermaLink="false">urn:hackerpapers:mention:2206.12693:45642910</guid><pubDate>Mon, 20 Oct 2025 11:58:21 GMT</pubDate><description>&lt;p&gt;That also works purely on text and it&amp;#x27;s the trick I used in my German speech recognition engine ( https://arxiv.org/abs/2206.12693 ). &amp;quot;I&amp;#x27;m studying at Oxford Univ&amp;quot; has basically no loss in meaning even though &amp;quot;University&amp;quot; was truncated to less than half its characters.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2206.12693/"&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>TEVR: Improving Speech Recognition by Token Entropy Variance Reduction — mentioned by fxtentacle</title><link>https://news.ycombinator.com/item?id=33791251</link><guid isPermaLink="false">urn:hackerpapers:mention:2206.12693:33791251</guid><pubDate>Tue, 29 Nov 2022 18:28:33 GMT</pubDate><description>&lt;p&gt;In this paper https://arxiv.org/abs/2206.12693 I show that choosing the text snippets deliberately so that your choices minimize overall entropy will also minimize result entropy, meaning it&amp;#x27;ll increase the accuracy of your speech recognition system (for German speech). In my case, the entropy-optimized tokenization also matched conserved features of the German language.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2206.12693/"&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>TEVR: Improving Speech Recognition by Token Entropy Variance Reduction — mentioned by nshm</title><link>https://news.ycombinator.com/item?id=32413636</link><guid isPermaLink="false">urn:hackerpapers:mention:2206.12693:32413636</guid><pubDate>Wed, 10 Aug 2022 15:30:24 GMT</pubDate><description>&lt;p&gt;This model seems strongly overtrained on CV test set. Usually improvement from LM rescoring is just 10% relative. In the paper https://arxiv.org/pdf/2206.12693.pdf the improvement is from 10.1% WER to 3.64% WER (Table 6). Such a big improvement suggests that LM is biased. Also, the perplexity of provided ngram LM on CV test set is just 86 and most of 5-gram histories are already in the LM. This also suggests bias.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2206.12693/"&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>
