A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Paraphrase Substitution for Recognizing Textual Entailment
[chapter]
2007
Lecture Notes in Computer Science
Preserved Fulltext
We describe a method for recognizing textual entailment that uses the length of the longest common subsequence (LCS) between two texts as its decision criterion. Rather than requiring strict word matching in the common subsequences, we perform a flexible match using automatically generated paraphrases. We find that the use of paraphrases over strict word matches represents an average F-measure improvement from 0.22 to 0.36 on the CLEF 2006 Answer Validation Exercise for 7 languages.
doi:10.1007/978-3-540-74999-8_60
fatcat:lepc2df3r5g2lj74sc4kefkqia