Abstract. The system utilizes a Recognizing Textual Entailment (RTE) approach. The system uses the question string (q_str) as a Text (T) and one answer (t_str) as a Hypothesis (H). We use two different approaches using machine learning, specifically Support Vector Machine as classifier. The results show an increment over the baselines, however enhanced is needed. The features used are unigram, bigram, and trigram overlap of lexemes and stems, Levenshtein distance, tf-idf measure, and semantic similarity using wordnet. Experimental results show that the best run of our initial system achieved a 0.21 of F-measure and 0.17 of QA-accuracy. This shows an increment of 23.53 % over the QA accuracy baseline
The problem of recognizing textual entailment (RTE) has been recently addressed using syntactic and ...
Abstract. This paper is about our approach to answer validation, which centered by a Recognizing Tex...
The problem of recognizing textual entailment (RTE) has been recently addressed with some success us...
This paper advocates a new architecture for textual inference in which finding a good alignment is s...
In this paper we present the use of a ”general purpose ” textual entaiment recognizer in the Answer ...
This paper proposes a new architecture for textual inference in which finding a good alignment is se...
Textual Entailment Recognition is a semantic inference task that is required in many natural languag...
In this paper we present the use of a "general purpose" textual entailment recognizer in the Answer ...
The problem of recognizing textual entailment (RTE) has been recently addressed using syntactic and ...
When two texts have an inclusion relation, the relationship between them is called entailment. The t...
We describe our participation in the PASCAL-2005 Recognizing Textual Entailment Challenge. Our metho...
Since 2005, researchers have worked on a broad task called Recognizing Textual Entailment (RTE), whi...
The problem of recognizing textual entailment (RTE) has been recently addressed using syntactic and ...
Abstract. This paper discusses the recognition of textual entailment in a text-hypothesis pair by ap...
Abstract. We present a Recognizing Textual Entailment system based on different similarity metrics. ...
The problem of recognizing textual entailment (RTE) has been recently addressed using syntactic and ...
Abstract. This paper is about our approach to answer validation, which centered by a Recognizing Tex...
The problem of recognizing textual entailment (RTE) has been recently addressed with some success us...
This paper advocates a new architecture for textual inference in which finding a good alignment is s...
In this paper we present the use of a ”general purpose ” textual entaiment recognizer in the Answer ...
This paper proposes a new architecture for textual inference in which finding a good alignment is se...
Textual Entailment Recognition is a semantic inference task that is required in many natural languag...
In this paper we present the use of a "general purpose" textual entailment recognizer in the Answer ...
The problem of recognizing textual entailment (RTE) has been recently addressed using syntactic and ...
When two texts have an inclusion relation, the relationship between them is called entailment. The t...
We describe our participation in the PASCAL-2005 Recognizing Textual Entailment Challenge. Our metho...
Since 2005, researchers have worked on a broad task called Recognizing Textual Entailment (RTE), whi...
The problem of recognizing textual entailment (RTE) has been recently addressed using syntactic and ...
Abstract. This paper discusses the recognition of textual entailment in a text-hypothesis pair by ap...
Abstract. We present a Recognizing Textual Entailment system based on different similarity metrics. ...
The problem of recognizing textual entailment (RTE) has been recently addressed using syntactic and ...
Abstract. This paper is about our approach to answer validation, which centered by a Recognizing Tex...
The problem of recognizing textual entailment (RTE) has been recently addressed with some success us...