Please use this identifier to cite or link to this item: https://doi.org/10.21256/zhaw-26147
Full metadata record
DC FieldValueLanguage
dc.contributor.authorvon Däniken, Pius-
dc.contributor.authorDeriu, Jan Milan-
dc.contributor.authorAgirre, Eneko-
dc.contributor.authorBrunner, Ursin-
dc.contributor.authorCieliebak, Mark-
dc.contributor.authorStockinger, Kurt-
dc.date.accessioned2022-11-18T14:48:44Z-
dc.date.available2022-11-18T14:48:44Z-
dc.date.issued2022-12-
dc.identifier.urihttps://aclanthology.org/2022.icnlsp-1.7de_CH
dc.identifier.urihttps://digitalcollection.zhaw.ch/handle/11475/26147-
dc.description.abstractNatural Language-to-Query systems translate a natural language question into a formal query language such as SQL. Typically the translation results in a set of candidate query statements due to the ambiguity of natural language. Hence, an important aspect of NL-to-Query systems is to rank the query statements so that the most relevant query is ranked on top. We propose a novel approach to significantly improve the query ranking and thus the accuracy of such systems. First, we use existing methods to translate the natural language question NL_in into k query statements and rank them. Then we translate each of the k query statements back into a natural language question NL_gen and use the semantic similarity between the original question NL_in and each of the k generated questions NL_gen to re-rank the output. Our experiments on two standard datasets, OTTA and Spider, show that this technique improves even strong state-of-the-art NL-to-Query systems by up to 9 percentage points. A detailed error analysis shows that our method correctly down-ranks queries with missing relations and wrong query types. While this work is focused on NL-to-Query, our method could be applied to any other semantic parsing problems as long as a text generation method is available.de_CH
dc.language.isoende_CH
dc.publisherAssociation for Computational Linguisticsde_CH
dc.rightshttps://creativecommons.org/licenses/by/4.0/de_CH
dc.subjectMachine learningde_CH
dc.subjectNatural language processingde_CH
dc.subjectDatabasede_CH
dc.subjectUser interfacede_CH
dc.subject.ddc005: Computerprogrammierung, Programme und Datende_CH
dc.subject.ddc006: Spezielle Computerverfahrende_CH
dc.titleImproving NL-to-Query systems through re-ranking of semantic hypothesisde_CH
dc.typeKonferenz: Paperde_CH
dcterms.typeTextde_CH
zhaw.departementSchool of Engineeringde_CH
zhaw.organisationalunitCentre for Artificial Intelligence (CAI)de_CH
zhaw.organisationalunitInstitut für Informatik (InIT)de_CH
dc.identifier.doi10.21256/zhaw-26147-
zhaw.conference.details5th International Conference on Natural Language and Speech Processing (ICNLSP), online, 16-17 December 2022de_CH
zhaw.funding.euinfo:eu-repo/grantAgreement/EC/H2020/863410//INODE - Intelligent Open Data Exploration/INODEde_CH
zhaw.originated.zhawYesde_CH
zhaw.pages.end67de_CH
zhaw.pages.start57de_CH
zhaw.parentwork.editorAbbas, Mourad-
zhaw.parentwork.editorFreihat, Abed Alhakim-
zhaw.publication.statuspublishedVersionde_CH
zhaw.publication.reviewPeer review (Publikation)de_CH
zhaw.title.proceedingsProceedings of the 5th International Conference on Natural Language and Speech Processing (ICNLSP 2022)de_CH
zhaw.webfeedIntelligent Information Systemsde_CH
zhaw.webfeedNatural Language Processingde_CH
zhaw.funding.zhawINODE – Intelligent Open Data Exploration (EU Horizon 2020)de_CH
zhaw.author.additionalNode_CH
zhaw.display.portraitYesde_CH
Appears in collections:Publikationen School of Engineering

Files in This Item:
File Description SizeFormat 
2022_vanDaeniken-etal_Improving-NL-to-Query-Systems_ICNLSP2022.pdf478.54 kBAdobe PDFThumbnail
View/Open
Show simple item record
von Däniken, P., Deriu, J. M., Agirre, E., Brunner, U., Cieliebak, M., & Stockinger, K. (2022). Improving NL-to-Query systems through re-ranking of semantic hypothesis [Conference paper]. In M. Abbas & A. A. Freihat (Eds.), Proceedings of the 5th International Conference on Natural Language and Speech Processing (ICNLSP 2022) (pp. 57–67). Association for Computational Linguistics. https://doi.org/10.21256/zhaw-26147
von Däniken, P. et al. (2022) ‘Improving NL-to-Query systems through re-ranking of semantic hypothesis’, in M. Abbas and A.A. Freihat (eds) Proceedings of the 5th International Conference on Natural Language and Speech Processing (ICNLSP 2022). Association for Computational Linguistics, pp. 57–67. Available at: https://doi.org/10.21256/zhaw-26147.
P. von Däniken, J. M. Deriu, E. Agirre, U. Brunner, M. Cieliebak, and K. Stockinger, “Improving NL-to-Query systems through re-ranking of semantic hypothesis,” in Proceedings of the 5th International Conference on Natural Language and Speech Processing (ICNLSP 2022), Dec. 2022, pp. 57–67. doi: 10.21256/zhaw-26147.
VON DÄNIKEN, Pius, Jan Milan DERIU, Eneko AGIRRE, Ursin BRUNNER, Mark CIELIEBAK und Kurt STOCKINGER, 2022. Improving NL-to-Query systems through re-ranking of semantic hypothesis. In: Mourad ABBAS und Abed Alhakim FREIHAT (Hrsg.), Proceedings of the 5th International Conference on Natural Language and Speech Processing (ICNLSP 2022) [online]. Conference paper. Association for Computational Linguistics. Dezember 2022. S. 57–67. Verfügbar unter: https://aclanthology.org/2022.icnlsp-1.7
von Däniken, Pius, Jan Milan Deriu, Eneko Agirre, Ursin Brunner, Mark Cieliebak, and Kurt Stockinger. 2022. “Improving NL-to-Query Systems through Re-Ranking of Semantic Hypothesis.” Conference paper. In Proceedings of the 5th International Conference on Natural Language and Speech Processing (ICNLSP 2022), edited by Mourad Abbas and Abed Alhakim Freihat, 57–67. Association for Computational Linguistics. https://doi.org/10.21256/zhaw-26147.
von Däniken, Pius, et al. “Improving NL-to-Query Systems through Re-Ranking of Semantic Hypothesis.” Proceedings of the 5th International Conference on Natural Language and Speech Processing (ICNLSP 2022), edited by Mourad Abbas and Abed Alhakim Freihat, Association for Computational Linguistics, 2022, pp. 57–67, https://doi.org/10.21256/zhaw-26147.


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.