About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
AAAI-FS 1999
Conference paper
Semantics and Complexity of Question AnsweringSystems: Towardsa Moore's Law for Natural LanguageEngineering
Abstract
There’s a proliferation of QA systems and NL chat systems on the Weband in intranets (e.g. www.neuromedia.com or www.ask.com). The question arises: how far are these systems from "real" NLU? After all, they seem to follow Eliza. Do they? How do we settle such questions? QAsystems typically comprise of an NLunderstanding systems and a knowledge base/database. Given a user’s query, what is the complexity of retrieving the information from the database? How do we approachthis problem? What does it mean that one query is more complex than the other? NLP is in demand. For this demand to be sustained we need a "Moore’s Law for natural language engineering", so that the business community could understand what is possible when and at what price.