Abstract. This paper describes our participation in the QA4MRE 2011 task, targeted at reading comprehension tests and multiple choice ques-tion answering. Our system constructs a co-occurrence graph with words that are common or proper nouns and verbs extracted from each docu-ment. The documents are pre-selected through an information retrieval process for recovering only those that are most relevant to a particular question. An algorithm to detect communities of words with signicant co-occurrence is applied to the co-occurrence graph. Each of the detected communities are treated as dierent contexts of a question in the cor-pus, and these contexts are used to nd the most suitable answer. Our evaluation results suggest that, the number of re...
This paper introduces a new technique of document clustering based on frequent senses. The proposed ...
In this paper we explore patterns in student behavior as they answer questions about documents they ...
We argue that any document set can be modelled as a hypergraph, and we apply a graph clustering proc...
In this paper, we introduce a new similarity measure between words, and a graph-based word clusterin...
A central operation of users of the text analysis tool Gavagai Explorer is to look through a list of...
Word clustering is important for automatic thesaurus construction, text classification, and word sen...
Word clustering is important for automatic thesaurus construction, text classification, and word sen...
The goal of clustering web search results is to reveal the semantics of the retrieved documents. The...
Social Question Answering (SQA) services are defined as dedicated platforms for users to respond to ...
Social question answering (SQA) services allow users to clarify their queries by asking questions an...
Social Question Answering (SQA) services are defined as dedicated platforms for users to respond to ...
Open responses form a rich but underused source of information in educational data mining and intell...
Social question answering (SQA) services allow users to clarify their queries by asking questions an...
This paper describes a lexical system developed for the main task of Question Answering for Machine ...
Question answering (QA) is one of the most important and challenging tasks for understanding human l...
This paper introduces a new technique of document clustering based on frequent senses. The proposed ...
In this paper we explore patterns in student behavior as they answer questions about documents they ...
We argue that any document set can be modelled as a hypergraph, and we apply a graph clustering proc...
In this paper, we introduce a new similarity measure between words, and a graph-based word clusterin...
A central operation of users of the text analysis tool Gavagai Explorer is to look through a list of...
Word clustering is important for automatic thesaurus construction, text classification, and word sen...
Word clustering is important for automatic thesaurus construction, text classification, and word sen...
The goal of clustering web search results is to reveal the semantics of the retrieved documents. The...
Social Question Answering (SQA) services are defined as dedicated platforms for users to respond to ...
Social question answering (SQA) services allow users to clarify their queries by asking questions an...
Social Question Answering (SQA) services are defined as dedicated platforms for users to respond to ...
Open responses form a rich but underused source of information in educational data mining and intell...
Social question answering (SQA) services allow users to clarify their queries by asking questions an...
This paper describes a lexical system developed for the main task of Question Answering for Machine ...
Question answering (QA) is one of the most important and challenging tasks for understanding human l...
This paper introduces a new technique of document clustering based on frequent senses. The proposed ...
In this paper we explore patterns in student behavior as they answer questions about documents they ...
We argue that any document set can be modelled as a hypergraph, and we apply a graph clustering proc...