2003 · 521 citations · 16 references
ComputingComputer ScienceDatabasesNatural Language ProcessingSemanticsNatural Language GenerationParsingQuery ProcessingQuestion AnsweringSyntactic AnalysisSyntax ParsingDatalogGraph MatchingNatural Language InterfacesNatural Language QueryingQuery AnsweringSemantic ParsingSemantic Question AnsweringSyntactic Constraints
The need for Natural Language Interfaces to databases (NLIs) has become increasingly acute as more and more people access information through their web browsers, PDAs, and cell phones. Yet NLIs are only usable if they map natural language questions to SQL queries correctly. As Schneiderman and Norman have argued, people are unwilling to trade reliable and predictable user interfaces for intelligent but unreliable ones. In this paper, we introduce a theoretical framework for reliable NLIs, which is the foundation for the fully implemented Precise NLI. We prove that, for a broad class of semantically tractable natural language questions, Precise is guaranteed to map each question to the corresponding SQL query. We report on experiments testing Precise on several hundred questions drawn from user studies over three benchmark databases. We find that over 80% of the questions are semantically tractable questions, which Precise answers correctly. Precise automatically recognizes the 20% of questions that it cannot handle, and requests a paraphrase. Finally, we show that Precise compares favorably with Mooney's learning NLI and with Microsoft's English Query product
16
V. J. Rayward‐Smith, Thomas H. Cormen, Charles E. Leiserson et al. · Journal of the Operational Research Society · 1991 · 17K citations
Leslie G. Valiant · 1984 · 4.2K citations
Leslie G. Valiant · Communications of the ACM · 1984 · 3.3K citations · Full text
1990 · 3.1K citations
A Maximum-Entropy-Inspired Parser
Eugene Charniak · 1999 · 1.5K citations
Language Studies, Computer Science, Computational Linguistics +16