Probabilistic question answering on the Web

✍ Scribed by Dragomir Radev; Weiguo Fan; Hong Qi; Harris Wu; Amardeep Grewal

• Publisher: John Wiley and Sons
• Year: 2005
• Tongue: English
• Weight: 200 KB
• Volume: 56
• Category: Article
• ISSN: 1532-2882
• DOI: 10.1002/asi.20146

✦ Synopsis

Abstract

Web‐based search engines such as Google and NorthernLight return documents that are relevant to a user query, not answers to user questions. We have developed an architecture that augments existing search engines so that they support natural language question answering. The process entails five steps: query modulation, document retrieval, passage extraction, phrase extraction, and answer ranking. In this article, we describe some probabilistic approaches to the last three of these stages. We show how our techniques apply to a number of existing search engines, and we also present results contrasting three different methods for question answering. Our algorithm, probabilistic phrase reranking (PPR), uses proximity and question type features and achieves a total reciprocal document rank of .20 on the TREC8 corpus. Our techniques have been implemented as a Web‐accessible system, called NSIR.