SciELO - Scientific Electronic Library Online

 issue43Assesing the Feature-Driven Nature of Similarity-based Sorting of VerbsExamining the Validity of Cross-Lingual Word Sense Disambiguation author indexsubject indexsearch form
Home Pagealphabetic serial listing  

Services on Demand




Related links

  • Have no similar articlesSimilars in SciELO



On-line version ISSN 1870-9044

Polibits  n.43 México Jan./Jun. 2011


Semantic Textual Entailment Recognition using UNL


Partha Pakray1*, Soujanya Poria1**, Sivaji Bandyopadhyay1***, and Alexander Gelbukh2


1 Computer Science and Engineering Department, Jadavpur University, Kolkata, India (e–mail: *, **, ***

2 Faculty of Law, Waseda University, Tokyo, Japan, on Sabbatical leave from the Center for Computing Research, National Polytechnic Institute, Mexico City, Mexico (e–mail:


Manuscript received November 2, 2010.
Manuscript accepted for publication January 12, 2011.



A two–way textual entailment (TE) recognition system that uses semantic features has been described in this paper. We have used the Universal Networking Language (UNL) to identify the semantic features. UNL has all the components of a natural language. The development of a UNL based textual entailment system that compares the UNL relations in both the text and the hypothesis has been reported. The semantic TE system has been developed using the RTE–3 test annotated set as a development set (includes 800 text–hypothesis pairs). Evaluation scores obtained on the RTE–4 test set (includes 1000 text–hypothesis pairs) show 55.89% precision and 65.40% recall for YES decisions and 66.50% precision and 55.20% recall for NO decisions and overall 60.3% precision and 60.3% recall.

Key words: Textual Entailment, Universal Networking Language (UNL), RTE–3 Test Annotated Data, RTE–4 Test Data





This work was supported in part by the Government of India and Government of Mexico (joint DST–CONACYT project) and Government of Mexico (CONACYT 50206–H, SIP–IPN 20113295, as well as SNI and CONACYT Sabbatical program as to the fourth author).



[1] R. Bar–Haim, I. Dagan, B. Dolan, L. Ferro, D. Giampiccolo, B. Magnini, and I. Szpektor, "The Second PASCAL Recognising Textual Entailment Challenge," in Proceedings of the Second PASCAL Challenges Workshop on Recognising Textual Entailment, Venice, Italy. 2006.         [ Links ]

[2] L. Bentivogli, I. Dagan, H.T. Dang, D. Giampiccolo, and B. Magnini, "The Fifth PASCAL Recognizing Textual Entailment Challenge," in TAC 2009 Workshop, National Institute of Standards and Technology Gaithersburg, Maryland USA. 2009.         [ Links ]

[3] J. Cardeñosa, A. Gelbukh, E. Tovar (eds.), Universal Networking Language: Advances in Theory and Applications, IPN. 2005;–book.         [ Links ]

[4] I. Dagan, O. Glickman, and B. Magnini, "The PASCAL Recognising Textual Entailment Challenge," in Proceedings of the PASCAL RTE Challenge. 2005.         [ Links ]

[5] D. Giampiccolo, H. T. Dang, B. Magnini, I. Dagan, and E. Cabrio, "The Fourth PASCAL Recognizing Textual Entailment Challenge," in TAC 2008 Proceedings. 2008.         [ Links ]

[6] D. Giampiccolo, B. Magnini, I. Dagan, and B. Dolan, "The Third PASCAL Recognizing Textual Entailment Challenge," in Proceedings of the ACL–PASCAL Workshop on Textual Entailment and Paraphrasing, Prague, Czech Republic. 2007.         [ Links ]

[7] UNDL Foundation, Universal networking language (UNL) specifications, edition 2006, August 2006.–e2006/.         [ Links ]

[8] E.M. Voorhees and D. Harman, "Overview of the Seventh Text Retrieval Conference," in Proceedings of the Seventh Text REtrieval Conference (TREC–7). NIST Special Publication. 1999.         [ Links ]

[9] D. Yuret, A. Han, and Z. Turgut, "SemEval–2010 Task 12: Parser Evaluation using Textual Entailments," in Proceedings of the SemEval–2010 Evaluation Exercises on Semantic Evaluation. 2010.         [ Links ]

[10] G. Zhao, M. Petridis, G. Sidorov, and J. Ma, "A critical examination of node similarity graph matching algorithm," Research in computing science, vol. 40, pp. 73–82, 2008.         [ Links ]

Creative Commons License All the contents of this journal, except where otherwise noted, is licensed under a Creative Commons Attribution License