
Textual Entailment Recognition with Semantic Features A PREPRINT
corresponding text-hypothesis pair. To classify the text-hypothesis pair, we apply multiple
machine learning classifiers that use different textual features including our introduced ones.
Then the ensemble of the ML algorithms with the majority voting technique is employed that
provides the final entailment relationship for the corresponding text-hypothesis pair. To validate
the performance of our method, a wide range of experiments are carried out on a benchmark
SICK-RTE dataset. The experimental results on the benchmark textual entailment classification
dataset achieved efficient performance to recognize different textual entailment relations. The
results also demonstrated that our approach outperforms some state-of-the-art methods.
The rest of the paper is organized as follows: Section 2presents some related works on RTE.
Then our method is discussed in Section 3. The details of the experiments with their results are
presented in Section 4. Finally, Section 5presents the conclusion with the future direction.
2 Related Work
With the first PASCAL challenge, textual entailment recognition has gained considerable attention
of the research community [Dagan et al.,2005]. Several research groups participated in this
challenge. But most of the methods applied lexical features (i.e., word-overlapping) with ML
algorithms to recognize entailment relation [Dagan et al.,2005]. Several RTE challenges have
been organized and some methods with promising performance on different downstream tasks
are proposed [Haim et al.,2006,Giampiccolo et al.,2007,2008,Bentivogli et al.,2009,2011,
Dzikovska et al.,2013,Paramasivam and Nirmala,2021]. Malakasiotis et al. [Malakasiotis and
Androutsopoulos,2007] proposed a method employing the string matching-based lexical and
shallow syntactic features with support vector machine (SVM). Four distance-based features
with SVM are also employed [Castillo and Alemany,2008]. The features include edit distance,
distance in WordNet, and longest common substring between texts.
Similarly, Pakray et al. [Pakray et al.,2009] applied multiple lexical features including WordNet-
based unigram match, bigram match, longest common sub-sequence, skip-gram, stemming,
and named entity matching. Finally, they applied SVM classifiers with introducing lexical
and syntactic similarity. Basak et al. [Basak et al.,2015] visualized the text and hypothesis
leveraging directed networks (dependency graphs), with nodes denoting words or phrases and
edges denoting connections between nodes. The entailment relationship is then identified by
matching the graphs’ with vertex and edge substitution. Some other methods made use of
bag-of-words, word-overlapping, logic-based reasoning, lexical entailment, ML-based methods,
and graph matching to recognize textual entailment[Ghuge and Bhattacharya,2014,Renjit and
Sumam,2022,Liu et al.,2016].
Bowman et al. [Bowman et al.,2015] introduced a Stanford Natural Language Inference corpus
(SNLI) dataset consists of labeled sentence pairs that can be used as a benchmark in NLP tasks.
This is a very large entailment (inference) dataset that provides the opportunity for researchers
to apply deep learning-based approaches to identify the entailment relation between text and
hypothesis. Therefore, different deep learning-based approaches including LSTM (Long Short
Term Memory), CNN (Convolutional Neural Network), BERT, and Transfer Learning are being
applied to RTE [Kiros et al.,2015,Vaswani et al.,2017,Devlin et al.,2018,Conneau et al.,2017].
All the methods either used lexical or semantic features. But our proposed method uses both
the lexical and semantic features including element-wise Manhattan distance vector (EMDV),
3