<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Neural Decipherment via Minimum-Cost Flow: from Ugaritic to Linear B · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1906.06718/</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/1906.06718/feed.xml" rel="self" type="application/rss+xml" /><item><title>Neural Decipherment via Minimum-Cost Flow: from Ugaritic to Linear B — mentioned by mkw5053</title><link>https://news.ycombinator.com/item?id=44948347</link><guid isPermaLink="false">urn:hackerpapers:mention:1906.06718:44948347</guid><pubDate>Tue, 19 Aug 2025 04:48:39 GMT</pubDate><description>&lt;p&gt;Very cool! I was just going down a rabbit hole yesterday about the use of AI techniques (or lack of success) in deciphering still-forgotten languages. Unsupervised models have partially cracked Ugaritic and Linear B [0], and Pythia/Ithaca restore Greek inscriptions at scale [1], but Linear A or Proto-Elamite still stall because the corpora are too small and there is no bilingual ‘Rosetta Stone’. The most promising direction now seems to be hybrid pipelines that combine vision encoders to normalize glyphs with constrained decoders guided by phonotactic priors. [0]…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1906.06718/"&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>Neural Decipherment via Minimum-Cost Flow: from Ugaritic to Linear B — mentioned by changoplatanero</title><link>https://news.ycombinator.com/item?id=31388297</link><guid isPermaLink="false">urn:hackerpapers:mention:1906.06718:31388297</guid><pubDate>Sun, 15 May 2022 15:50:26 GMT</pubDate><description>&lt;p&gt;You mean like this? https://arxiv.org/pdf/1906.06718.pdf&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1906.06718/"&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>Neural Decipherment via Minimum-Cost Flow: from Ugaritic to Linear B — HN submission</title><link>https://news.ycombinator.com/item?id=24848588</link><guid isPermaLink="false">urn:hackerpapers:submission:1906.06718:24848588</guid><pubDate>Wed, 21 Oct 2020 15:12:05 GMT</pubDate><description>&lt;p&gt;Neural Decipherment via Minimum-Cost Flow: From Ugaritic to Linear B&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;30 points; 13 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/1906.06718/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.CL</category></item><item><title>Neural Decipherment via Minimum-Cost Flow: from Ugaritic to Linear B — HN submission</title><link>https://news.ycombinator.com/item?id=20503162</link><guid isPermaLink="false">urn:hackerpapers:submission:1906.06718:20503162</guid><pubDate>Mon, 22 Jul 2019 23:16:25 GMT</pubDate><description>&lt;p&gt;Neural Decipherment via Minimum-Cost Flow: from Ugaritic to Linear B&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;76 points; 7 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/1906.06718/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.CL</category></item><item><title>Neural Decipherment via Minimum-Cost Flow: from Ugaritic to Linear B — HN submission</title><link>https://news.ycombinator.com/item?id=20439758</link><guid isPermaLink="false">urn:hackerpapers:submission:1906.06718:20439758</guid><pubDate>Mon, 15 Jul 2019 11:28:02 GMT</pubDate><description>&lt;p&gt;Neural Decipherment via Minimum-Cost Flow: From Ugaritic to Linear B&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;2 points; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/1906.06718/"&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>
