An efficient method for Natural Language Querying on Structured Data

Hanoz Bhathena, Aviral Joshi, Prateek Singh


Abstract
We present an efficient and reliable approach to Natural Language Querying (NLQ) on databases (DB) which is not based on text-to-SQL type semantic parsing. Our approach simplifies the NLQ on structured data problem to the following “bread and butter” NLP tasks: (a) Domain classification, for choosing which DB table to query, whether the question is out-of-scope (b) Multi-head slot/entity extraction (SE) to extract the field criteria and other attributes such as its role (filter, sort etc) from the raw text and (c) Slot value disambiguation (SVD) to resolve/normalize raw spans from SE to format suitable to query a DB. This is a general purpose, DB language agnostic approach and the output can be used to query any DB and return results to the user. Also each of these tasks is extremely well studied, mature, easier to collect data for and enables better error analysis by tracing problems to specific components when something goes wrong.
Anthology ID:
2023.acl-industry.31
Volume:
Proceedings of the 61st Annual Meeting of the Association for Computational Linguistics (Volume 5: Industry Track)
Month:
July
Year:
2023
Address:
Toronto, Canada
Editors:
Sunayana Sitaram, Beata Beigman Klebanov, Jason D Williams
Venue:
ACL
SIG:
Publisher:
Association for Computational Linguistics
Note:
Pages:
322–331
Language:
URL:
https://aclanthology.org/2023.acl-industry.31
DOI:
10.18653/v1/2023.acl-industry.31
Bibkey:
Cite (ACL):
Hanoz Bhathena, Aviral Joshi, and Prateek Singh. 2023. An efficient method for Natural Language Querying on Structured Data. In Proceedings of the 61st Annual Meeting of the Association for Computational Linguistics (Volume 5: Industry Track), pages 322–331, Toronto, Canada. Association for Computational Linguistics.
Cite (Informal):
An efficient method for Natural Language Querying on Structured Data (Bhathena et al., ACL 2023)
Copy Citation:
PDF:
https://aclanthology.org/2023.acl-industry.31.pdf