scholarly journals Query Generation for Multimodal Documents

Author(s):  
Kyungho Kim ◽  
Kyungjae Lee ◽  
Seung-won Hwang ◽  
Young-In Song ◽  
Seungwook Lee
Keyword(s):  
Author(s):  
Yanji Chen ◽  
Mieczyslaw M. Kokar ◽  
Jakub J. Moskal

AbstractThis paper describes a program—SPARQL Query Generator (SQG)—which takes as input an OWL ontology, a set of object descriptions in terms of this ontology and an OWL class as the context, and generates relatively large numbers of queries about various types of descriptions of objects expressed in RDF/OWL. The intent is to use SQG in evaluating data representation and retrieval systems from the perspective of OWL semantics coverage. While there are many benchmarks for assessing the efficiency of data retrieval systems, none of the existing solutions for SPARQL query generation focus on the coverage of the OWL semantics. Some are not scalable since manual work is needed for the generation process; some do not consider (or totally ignore) the OWL semantics in the ontology/instance data or rely on large numbers of real queries/datasets that are not readily available in our domain of interest. Our experimental results show that SQG performs reasonably well with generating large numbers of queries and guarantees a good coverage of OWL axioms included in the generated queries.


2018 ◽  
Author(s):  
Izzeddin Gur ◽  
Semih Yavuz ◽  
Yu Su ◽  
Xifeng Yan
Keyword(s):  

Author(s):  
Yu Zeng ◽  
Yan Gao ◽  
Jiaqi Guo ◽  
Bei Chen ◽  
Qian Liu ◽  
...  

Neural semantic parsers usually fail to parse long and complicated utterances into nested SQL queries, due to the large search space. In this paper, we propose a novel recursive semantic parsing framework called RECPARSER to generate the nested SQL query layer-by-layer. It decomposes the complicated nested SQL query generation problem into several progressive non-nested SQL query generation problems. Furthermore, we propose a novel Question Decomposer module to explicitly encourage RECPARSER to focus on different components of an utterance when predicting SQL queries of different layers. Experiments on the Spider dataset show that our approach is more effective compared to the previous works at predicting the nested SQL queries. In addition, we achieve an overall accuracy that is comparable with state-of-the-art approaches.


Author(s):  
Honoka Kakimoto ◽  
Yuanyuan Wang ◽  
Yukiko Kawai ◽  
Kazutoshi Sumiya

1995 ◽  
Vol 32 (03) ◽  
pp. 793-804 ◽  
Author(s):  
R. S. Valiveti ◽  
B. J. Oommen ◽  
J. R. Zgierski

We consider the problem of reorganizing a linear list, when the individual queries consist of accesses to a subset of the elements stored, as opposed to the individual elements themselves. In this paper, which to our knowledge represents the first reported result in this model of query processing, we first propose a simple model for a query generator which emits set queries. Subsequently, we present extensions to the classical move-to-front (MTF) and transposition (TR) rules under this generalized query generation mechanism and analyze their performance.


Sign in / Sign up

Export Citation Format

Share Document