<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Boundless Byte Pair Encoding: Breaking the Pre-tokenization Barrier · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2504.00178/</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/2504.00178/feed.xml" rel="self" type="application/rss+xml" /><item><title>Boundless Byte Pair Encoding: Breaking the Pre-tokenization Barrier — mentioned by cschmidt</title><link>https://news.ycombinator.com/item?id=44369438</link><guid isPermaLink="false">urn:hackerpapers:mention:2504.00178:44369438</guid><pubDate>Tue, 24 Jun 2025 18:45:00 GMT</pubDate><description>&lt;p&gt;This paper has a good solution: https://arxiv.org/abs/2402.14903 You right to left tokenize in groups of 3, so 1234567 becomes 1 234 567 rather than the default 123 456 7. And if you ensure all 1-3 digits groups are in the vocab, it does much better. Both https://arxiv.org/abs/2503.13423 and https://arxiv.org/abs/2504.00178 (co-author) both independently noted that you can do this with just by modifying the pre-tokenization regex, without having to explicitly add commas.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2504.00178/"&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>Boundless Byte Pair Encoding: Breaking the Pre-tokenization Barrier — mentioned by yuvalpinter</title><link>https://news.ycombinator.com/item?id=44142362</link><guid isPermaLink="false">urn:hackerpapers:mention:2504.00178:44142362</guid><pubDate>Sat, 31 May 2025 06:47:52 GMT</pubDate><description>&lt;p&gt;This can also be done within the tokenization framework, see our work here: https://arxiv.org/abs/2504.00178&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2504.00178/"&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>
