Conversational querying

The traditional interaction mechanism with a database system is through the use of a query language, the most widely used one being SQL. However, when one is facing a situation where he or she has to make a minor modification to a previously issued SQL query, either the whole query has to be written from scratch, or one has to invoke an editor to edit the query. This, however, is not the way we converse with each other as humans. During the course of a conversation, the preceding interaction is used as a context within which many incomplete and/or incremental phrases are uniquely and unambiguously interpreted, sparing the need to repeat the same things again and again. In this paper, we present an effective mechanism that allows a user to interact with a database system in a way similar to the way humans converse. More specifically, incomplete SQL queries are accepted as input which are then matched to identified parts of previously issued queries. Disambiguation is achieved by using various types of semantic information. The overall method works independently of the domain under which it is used (i.e., independently of the database schema). Several algorithms that are variations of the same basic mechanism are proposed. They are mutually compared with respect to efficiency and accuracy through a limited set of experiments on human subjects. The results have been encouraging, especially when semantic knowledge from the schema is exploited, laying a potential foundation for conversational querying in databases.

[1]  Stephen G. Pulman,et al.  Comparatives and Ellipsis , 1991, EACL.

[2]  Michael Halliday,et al.  Cohesion in English , 1976 .

[3]  D. G. Shin Semantics modeling issues for processing natural language database queries , 1990, CSC '90.

[4]  Wesley W. Chu,et al.  A Case-Based Reasoning Approach for Associative Query Answering , 1994, ISMIS.

[5]  Guogen Zhang,et al.  Associative query answering via query feature similarity , 1997, Proceedings Intelligent Information Systems. IIS'97.

[6]  Luis De Sopena Natural Language Grammars for an Information System , 1983, SIGIR.

[7]  G. Lakoff,et al.  Metaphors We Live by , 1981 .

[8]  Flávia de Almeida Barros Semi-Automatic Anaphora Resolution in Portable Natural Language Interfaces , 1996, SBIA.

[9]  Scott Weinstein,et al.  Centering: A Framework for Modeling the Local Coherence of Discourse , 1995, CL.

[10]  Jaime G. Carbonell,et al.  Anaphora Resolution: A Multi-Strategy Approach , 1988, COLING.

[11]  Edward Sciore Query Abbreviation in the Entity-Relationship Model , 1994, Inf. Syst..

[12]  Gerard Salton,et al.  Automatic Text Processing: The Transformation, Analysis, and Retrieval of Information by Computer , 1989 .

[13]  Fred J. Damerau Problems and some solutions in customization of natural language database front ends , 1985, TOIS.

[14]  Yannis E. Ioannidis,et al.  Incomplete path expressions and their disambiguation , 1994, SIGMOD '94.

[15]  Sven Lorenz Presupposition, Anaphora, and Reasoning about Change , 1992, ECAI.

[16]  Matthias Jarke,et al.  A framework for choosing a database query language , 1985, CSUR.

[17]  Miron Livny,et al.  Zoo: a desktop experiment management environment , 1997, SIGMOD '97.

[18]  Sandra Carberry A Pragmatics-Based Approach to Ellipsis Resolution , 1989, Comput. Linguistics.

[19]  Gérard P. Huet,et al.  A Unification Algorithm for Typed lambda-Calculus , 1975, Theor. Comput. Sci..

[20]  Qiming Chen,et al.  CoBase: a cooperative database system , 1994 .

[21]  Norman K. Sondheimer,et al.  An Improved Heuristic for Ellipsis Processing , 1982, ACL.

[22]  Alan W. Biermann,et al.  Efficient Collaborative Discourse: A Theory and Its Implementation , 1993, HLT.

[23]  Frank Meng,et al.  Query formulation from high-level concepts for relational databases , 1999, Proceedings User Interfaces to Data Intensive Systems.

[24]  R. Montague Formal philosophy; selected papers of Richard Montague , 1974 .