event thumbnail image
PASCAL Challenges Workshop 1

Recognizing Textual Entailment with Edit Distance Algorithms

author: Bernardo Magnini, University of Trento
You might be experiencing some problems with Your Video player.
Slides
0:15 Recognizing Textual Entailment with Tree Edit Distance Algorithms
0:45 Outline
2:02 Entailment and Tree Edit Distance
4:34 System Architecture
6:08 Tree Edit Distance on Dependency Trees
7:58 Cost functions
9:25 Results
9:57 Analysis
11:40 Conclusion and future work

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.

Related content

Link this page

Would you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !

Write your own review or comment:

make sure you have javascript enabled or clear this field: