The principal result of this paper answers a long-standing question in the model theory of arithmetic [KS, Question 7] by showing that there exists an uncountable arithmetically cl...
This paper reports on Lymba Corporation’s (a spinoff of Language Computer Corporation) participation in the TREC 2007 Question Answering track. An overview of the PowerAnswer 4 ...
This paper is motivated by the open question whether the union of two disjoint NPcomplete sets always is NP-complete. We discover that such unions retain much of the complexity of...
Abstract. In this paper the methodology followed to build a questionanswering system for the Portuguese language is described. The system modules are built using computational ling...
Automatic tools for analyzing student online discussions are highly desirable for better assistance and scaffolding. This paper presents an approach for automatically identifying s...