Pith. sign in

REVIEW 4 cited by

SUQL: Conversational Search over Structured and Unstructured Data with Large Language Models

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2311.09818 v2 pith:UEHN64X2 submitted 2023-11-16 cs.CL cs.PL

classification cs.CLcs.PL
keywords datastructuredsuqlconversationalknowledgelargecorporafree-text
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

While most conversational agents are grounded on either free-text or structured knowledge, many knowledge corpora consist of hybrid sources. This paper presents the first conversational agent that supports the full generality of hybrid data access for large knowledge corpora, through a language we developed called SUQL (Structured and Unstructured Query Language). Specifically, SUQL extends SQL with free-text primitives (summary and answer), so information retrieval can be composed with structured data accesses arbitrarily in a formal, succinct, precise, and interpretable notation. With SUQL, we propose the first semantic parser, an LLM with in-context learning, that can handle hybrid data sources. Our in-context learning-based approach, when applied to the HybridQA dataset, comes within 8.9% exact match and 7.1% F1 of the SOTA, which was trained on 62K data samples. More significantly, unlike previous approaches, our technique is applicable to large databases and free-text corpora. We introduce a dataset consisting of crowdsourced questions and conversations on Yelp, a large, real restaurant knowledge base with structured and unstructured data. We show that our few-shot conversational agent based on SUQL finds an entity satisfying all user requirements 90.3% of the time, compared to 63.4% for a baseline based on linearization.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 4 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Research Challenges in Relational Database Management Systems for LLM Queries

    cs.DB 2025-08 conditional novelty 5.0 of 10

    Open-source SQL-plus-LLM database integrations fail on most representative LLM queries and run orders of magnitude slower than enterprise APIs, due to missing structured outputs, poor batching, and plan-unaware LLM calls.

  2. HyST: LLM-Powered Hybrid Retrieval over Semi-Structured Tabular Data

    cs.IR 2025-08 conditional novelty 4.0 of 10

    A hybrid retrieval system that combines LLM-generated attribute filters with embedding search outperforms several baselines on a small, curated semi-structured product benchmark.

  3. Querying Databases with Function Calling

    cs.DB 2025-01 conditional novelty 4.0 of 10

    A new tool definition and synthetic benchmark show top LLMs can format database query calls via function calling, with the best models scoring around 74% exact-match accuracy.

  4. Adaptations of AI models for querying the LandMatrix database in natural language

    cs.CL 2024-12 conditional novelty 4.0 of 10

    On a roughly 60-question Land Matrix benchmark, Codestral-22B with an agentic LLM pipeline generates the most syntactically valid REST and GraphQL queries, though overall accuracy remains modest.

Pith tools