Abstract
The Recognizing Textual Entailment System shown here is based on the use of a broad-coverage parser to extract dependency relationships; in addition, WordNet relations are used to recognize entailment at the lexical level. The work investigates whether the mapping of dependency trees from text and hypothesis give better evidence of entailment than the matching of plain text alone. While the use of WordNet seems to improve system’s performance, the notion of mapping between trees here explored (inclusion) shows no improvement, suggesting that other notions of tree mappings should be explored such as tree edit distances or tree alignment distances.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Barzilay, R., Lee, L.: Learning to Paraphrase: An Unsupervised Approach UsingMultiple- Sequence Alignment. In: NAACL-HLT (2003)
Bille, P.: Tree Edit Distance, Alignment Distance and Inclusion. Technical Report TR-2003- 23, IT Technical Report Series (March 2003)
Dagan, I., Glickman, O., Magnini, B.: The PASCAL Recognising Textual Entailment Challenge. In: Proceedings of the PASCAL Challenges Workshop on Recognising Textual Entailment, Southampton, UK, April 2005, pp. 1–8 (2005)
Gusfield, R.: Algoritms on Strings, Trees and Sequences. Cambridge University Press, Cambridge (1997)
Hermjakob, U., Echibabi, A., Marcu, D.: Natural Language Based Reformulation Resource and Web Exploitation for Question Answering. In: Proceedings of TREC (2002)
Kilpeläinen, P.: Tree Matching Problems with Applications to Structured Text Databases. Technical Report A-1992-6, Department of Computer Science, University of Helsinki, Helsinki, Finland (November 1992)
Kouylekov, M., Magnini, B.: Recognizing Textual Entailment with Tree Edit Distance Algorithms. In: Proceedings of the PASCAL Challenges Workshop on Recognising Textual Entailment, Southampton, UK, April 2005, pp. 17–20 (2005)
Levensthein, V.I.: Binary Codes Capable of Correcting Deletions, Insertions and Reversals. Soviet Physics - Doklady 10, 707–710 (1966)
Lin, D.: Dependency-based Evaluation of MINIPAR. In: Workshop on the Evaluation of Parsing Systems, Granada, Spain (May 1998)
Lin, D., Pantel, P.: DIRT - Discovery of Inference Rules from Text. In: Proceedings of ACM SIGKDD Conference on Knowledge Discovery and Data Mining, pp. 323–328 (2001)
Quinlan, J.R.: C4.5: Programs for Machine Learning. Morgan Kaufman, San Francisco (1993)
Szpektor, I., Tanev, H., Dagan, I., Coppola, B.: Scaling Web-Based Acquisition of Entailment Relations. In: Proceedings of Empirical Methods in Natural Language Processing, EMNLP 2004 (2004)
Valiente, G.: An Efficient Bottom-Up Distance Between Trees. In: Proceedings of the International Symposium on String Processing and Information REtrieval, SPIRE, pp. 212–219 (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Herrera, J., Peñas, A., Verdejo, F. (2006). Textual Entailment Recognition Based on Dependency Analysis and WordNet . In: Quiñonero-Candela, J., Dagan, I., Magnini, B., d’Alché-Buc, F. (eds) Machine Learning Challenges. Evaluating Predictive Uncertainty, Visual Object Classification, and Recognising Tectual Entailment. MLCW 2005. Lecture Notes in Computer Science(), vol 3944. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11736790_13
Download citation
DOI: https://doi.org/10.1007/11736790_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-33427-9
Online ISBN: 978-3-540-33428-6
eBook Packages: Computer ScienceComputer Science (R0)