Tree Edit Distance for Recognizing Textual Entailment: Estimating the Cost of Insertion

author: Milen Kouylekov, University of Trento

Description

The focus of our participation in PASCAL RTE2 was estimating the cost of the information of the hypothesis which is missing in the text and can not be matched with entailment rules. We have tested different system settings for calculating the importance of the words of the hypothesis and investigated the possibility of combining them with machine learning algorithm.

You might be experiencing some problems with Your Video player.

*Slides*
0:00	Tree Edit Distance for Recognizing Textual Entailment: Estimating the Cost of Insertion
0:17	Our Goals
0:51	The Textual Entailment Framework
1:25	Entailment and Tree Edit Distance
2:03	Tree Edit Distance on Dependancy Trees
2:39	Cost Functions
4:07	Example (1)
5:30	Example (2)
6:29	System Settings
8:32	System Settings - Performance (1)
9:39	System Settings - Performance (2)
12:25	Thank You!

Lecture rating

People found this lecture:
Worth seeing
because it is:
Valuable and informative
Well presented
Easily understandable
Acceptably recorded
You need to login to cast your vote.

Report a problem or upload files

If you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.