<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Semantic Operators: A Declarative Model for Rich, AI-based Data Processing · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2407.11418/</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/2407.11418/feed.xml" rel="self" type="application/rss+xml" /><item><title>Semantic Operators: A Declarative Model for Rich, AI-based Data Processing — mentioned by anishathalye</title><link>https://news.ycombinator.com/item?id=45251057</link><guid isPermaLink="false">urn:hackerpapers:mention:2407.11418:45251057</guid><pubDate>Mon, 15 Sep 2025 15:42:24 GMT</pubDate><description>&lt;p&gt;Yeah, that was just a design choice that I made: I wanted a library that worked with `Iterator`s, felt more lightweight to me / fit my immediate needs better. I&amp;#x27;m personally not a huge fan of Pandas DataFrames for certain applications. LOTUS (by Liana Patel et al., folks from Stanford and Berkeley; https://arxiv.org/abs/2407.11418) extends Pandas DataFrames with semantic operators, you could check out their open-source library: https://github.com/lotus-data/lotus Semlib does batch requests, that was one of the primary motivations (I wanted to solve some concrete data processing tasks, started…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2407.11418/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.DB</category></item><item><title>Semantic Operators: A Declarative Model for Rich, AI-based Data Processing — mentioned by anishathalye</title><link>https://news.ycombinator.com/item?id=45250441</link><guid isPermaLink="false">urn:hackerpapers:mention:2407.11418:45250441</guid><pubDate>Mon, 15 Sep 2025 14:55:29 GMT</pubDate><description>&lt;p&gt;That was a small self-contained example that fit above the fold in the README (and fwiw even last year’s models like GPT-4o give the right output there). That `sort` is based on pairwise comparisons, which is one of the best ways you can do it in terms of accuracy (Qin et al., 2023: https://arxiv.org/abs/2306.17563). I think there are many real use cases where you might want a semantic sort / semantic data processing in general, when there isn’t a deterministic way to do the task and there is not necessarily a single right answer, and some amount of error (due to LLMs being imperfect) is…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2407.11418/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.DB</category></item></channel></rss>
