Textual Entailment Recognition based on dependency analysis and WordNet

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3944 LNAI, Issue , 2006, Pages 231-239

  Herrera, Jesús ^a   Peñas, Anselme ^a   Verdejo, Felisa ^a  

^a UNIVERSIDAD NACIONAL DE EDUCACIÓN A DISTANCIA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; COMPUTER SCIENCE; INFORMATION TECHNOLOGY; MAPPING; PATTERN MATCHING; TREES (MATHEMATICS);

DEPENDENCY TREES; PARSERS; TREE ALIGNMENT; WORDNET;

TEXT PROCESSING;

EID: 33745836132     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11736790_13     Document Type: Conference Paper

References (13)

1. R. Barzilay and L. Lee. Learning to Paraphrase: An Unsupervised Approach Using Multiple-Sequence Alignment. In NAACL-HLT, 2003.
2. P. Bille. Tree Edit Distance, Alignment Distance and Inclusion. Technical Report TR-2003-23, IT Technical Report Series, March 2003.
3. I. Dagan, O. Glickman, and B. Magnini. The PASCAL Recognising Textual Entailment Challenge. In Proceedings of the PASCAL Challenges Workshop on Recognising Textual Entailment, Southampton, UK, pages 1-8, April 2005.
4. R. Gusfield. Algoritms on Strings, Trees and Sequences. Cambridge University Press, 1997.
5. U. Hermjakob, A. Echibabi, and D. Marcu. Natural Language Based Reformulation Resource and Web Exploitation for Question Answering. In Proceedings of TREC, 2002.
6. P. Kilpeläinen. 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.
7. M. Kouylekov and B. Magnini. Recognizing Textual Entailment with Tree Edit Distance Algorithms. In Proceedings of the PASCAL Challenges Workshop on Recognising Textual Entailment, Southampton, UK, pages 17-20, April 2005.
8. V. I. Levensthein. Binary Codes Capable of Correcting Deletions, Insertions and Reversals. In Soviet Physics - Doklady, volume 10, pages 707-710, 1966.
9. D. Lin. Dependency-based Evaluation of MINIPAR. In Workshop on the Evaluation of Parsing Systems, Granada, Spain, May 1998.
10. D. Lin and P. Pantel. DIRT - Discovery of Inference Rules from Text. In Proceedings of ACM SIGKDD Conference on Knowledge Discovery and Data Mining, pages 323-328, 2001.
11. J.R. Quinlan. C4.5: Programs for Machine Learning. Morgan Kaufman, 1993.
12. I. Szpektor, H. Tanev, I. Dagan, and B. Coppola. Scaling Web-Based Acquisition of Entailment Relations. In Proceedings of Empirical Methods in Natural Language Processing (EMNLP-04), 2004.
13. G. Valiente. An Efficient Bottom-Up Distance Between Trees. In Proceedings of the International Symposium on String Processing and Information Retrieval, SPIRE, pages 212-219, 2001.