Many questions submitted to community question answering (CQA) sites such as Yahoo!Answers can be reasonably answered by a simple query to a standard Web search engine. However, the user may not know how to reduce their question, which may be several paragraphs in length, down to the 2-4 terms that will return an answer. The work in this short paper is directed towards the creation of a system ...

Introduction: Machine learning has previously been applied to text analysis. There is limited data regarding the acceptability or accuracy of such applications in medical education. This project examined student opinion computer-based marking and evaluated deep (DL), a subtype machine learning, scoring short answer questions (SAQs). Methods: Fourth- fifth-year students undertook an anonymised o...

Assessment is a key component of the teaching and learning process. In most Algerian Universities, assessing a student’s answer to an open ended question, even if it is a short answer question, is a difficult and time-consuming activity. In order to enhance the learning process quality and the global student evaluation process and to highly reduce the assessment time and difficulties, most Alge...

Our aim is to investigate computational linguistics (CL) techniques in marking short free text responses automatically. Successful automatic marking of free text answers would seem to presuppose an advanced level of performance in automated natural language understanding. However, recent advances in CL techniques have opened up the possibility of being able to automate the marking of free text ...

Document or passage retrieval is typically used as the first step in current question answering systems. The accuracy of the answer that is extracted from the passages and the efficiency of the question answering process will depend to some extent on the quality of this initial ranking. We show how language model approaches can be used to improve answer passage ranking. In particular, we show h...

Using elementary techniques, a question named after the famous Russian mathematician I. M. Gelfand is answered. This concerns the leading (i.e., most significant) digit in the decimal expansion of integers 2n, 3n, . . . , 9n . The history of this question, some of which is very recent, is reviewed.

Nagy's question is whether or not every power-bounded operator is similar to a contraction [3]. ("Power-bounded" means that the norms of the positive powers are bounded.) Foguel's answer is no [l]. The purpose of this note is to look at Foguel's ingenious counterexample from a point of view somewhat different from his own. The advantage of the new look is that it is less computational; its draw...