We prove that the out-distance sequence {f+ (k)} of a vertex-transitive digraph of finite or infinite degree satisfies f+ (k + 1) f+ (k)2 for k 1, where f+ (k) denotes the numbe...
This paper describes a knowledge-based methodologyof miningtextual answersinto large collections of texts. Wepresent SOMBRERO,a knowledge processing module implemented in the LASS...
Abstract This paper investigates whether a machine can automatically learn the task of finding, within a large collection of candidate responses, the answers to questions. The lea...
Adam L. Berger, Rich Caruana, David Cohn, Dayne Fr...
Question answering (QA) systems aim at retrieving precise information from a large collection of documents. To be considered as reliable by users, a QA system must provide element...
Discovering relations among Named Entities (NEs) from large corpora is both a challenging, as well as useful task in the domain of Natural Language Processing, with applications i...