2009
DOI: 10.1017/s1351324909990143
|View full text |Cite
|
Sign up to set email alerts
|

A machine learning approach to textual entailment recognition

Abstract: Designing models for learning textual entailment recognizers from annotated examples is not an easy task, as it requires modeling the semantic relations and interactions involved between two pairs of text fragments. In this paper, we approach the problem by first introducing the class of pair feature spaces, which allow supervised machine learning algorithms to derive first-order rewrite rules from annotated examples. In particular, we propose syntactic and shallow semantic feature spaces, and compare them to … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
21
0

Year Published

2010
2010
2023
2023

Publication Types

Select...
4
3
2

Relationship

1
8

Authors

Journals

citations
Cited by 54 publications
(21 citation statements)
references
References 26 publications
0
21
0
Order By: Relevance
“…However, their methods lack the use of important relational information between a question and a candidate answer, which is essential to learn accurate relational patterns. In this respect, a solution based on enumerating relational links was given in [55,56] for the textual entailment task but it is computationally too expensive for the large dataset of QA. Some faster versions were provided in [32,54], which may be worth to try.…”
Section: Related Workmentioning
confidence: 99%
“…However, their methods lack the use of important relational information between a question and a candidate answer, which is essential to learn accurate relational patterns. In this respect, a solution based on enumerating relational links was given in [55,56] for the textual entailment task but it is computationally too expensive for the large dataset of QA. Some faster versions were provided in [32,54], which may be worth to try.…”
Section: Related Workmentioning
confidence: 99%
“…Other approaches map the two texts to a vector space model, where each word is mapped to strongly co-occurring words in the corpus (Mitchell & Lapata, 2008), and then similarity measures over those vectors are applied. Some measure syntactic similarity by applying graph similarity measure on the syntactic dependency graphs of the two texts (Zanzotto, Pennacchiotti, & Moschitti, 2009). Similarly, other methods measure the semantic distance similarity between the words in text (Haghighi, 2005), usually exploiting other resources such as WordNet as well.…”
Section: Textual Entailment Recognitionmentioning
confidence: 99%
“…The problem of determining the similarity between texts has been widely studied for a variety of problems and a range of techniques have been developed [Seo and Croft 2008;Bendersky and Croft 2009;Mohler and Mihalcea 2009;Zanzotto et al 2009]. However, these have only limited applications to CH data.…”
Section: Introductionmentioning
confidence: 99%