DocETL: Agentic Query Rewriting and Evaluation for Complex Document Processing — mentioned by anishathalye

Mon, 15 Sep 2025 14:55:29 GMT

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…

Paper and discussion history. A mention is not an endorsement.

DocETL: Agentic Query Rewriting and Evaluation for Complex Document Processing · HackerPapers discussions

DocETL: Agentic Query Rewriting and Evaluation for Complex Document Processing — mentioned by anishathalye