1 RTE2 2006 April 10, 2006 An approach based on Logic Forms and WordNet relationships to Textual Entailment performance O. Ferrández, R. M. Terol, R. Muñoz,

Slides:



Advertisements
Similar presentations
SOCIAL WATCH Gender Equity Index Karina Batthyány Social Science Research Team.
Advertisements

COGEX at the Second RTE Marta Tatu, Brandon Iles, John Slavick, Adrian Novischi, Dan Moldovan Language Computer Corporation April 10 th, 2006.
Introducing Formal Methods, Module 1, Version 1.1, Oct., Formal Specification and Analytical Verification L 5.
COGEX at the Second RTE Marta Tatu, Brandon Iles, John Slavick, Adrian Novischi, Dan Moldovan Language Computer Corporation April 10 th, 2006.
Improved TF-IDF Ranker
Recognizing Textual Entailment Challenge PASCAL Suleiman BaniHani.
Semantic News Recommendation Using WordNet and Bing Similarities 28th Symposium On Applied Computing 2013 (SAC 2013) March 21, 2013 Michel Capelle
1 Extended Gloss Overlaps as a Measure of Semantic Relatedness Satanjeev Banerjee Ted Pedersen Carnegie Mellon University University of Minnesota Duluth.
Phylogenetic reconstruction
Normalized alignment of dependency trees for detecting textual entailment Erwin Marsi & Emiel Krahmer Tilburg University Wauter Bosma & Mariët Theune University.
Faculty Of Applied Science Simon Fraser University Cmpt 825 presentation Corpus Based PP Attachment Ambiguity Resolution with a Semantic Dictionary Jiri.
1/27 Semantics Going beyond syntax. 2/27 Semantics Relationship between surface form and meaning What is meaning? Lexical semantics Syntax and semantics.
Sentiment Lexicon Creation from Lexical Resources BIS 2011 Bas Heerschop Erasmus School of Economics Erasmus University Rotterdam
Using Maximal Embedded Subtrees for Textual Entailment Recognition Sophia Katrenko & Pieter Adriaans Adaptive Information Disclosure project Human Computer.
UNED at PASCAL RTE-2 Challenge IR&NLP Group at UNED nlp.uned.es Jesús Herrera Anselmo Peñas Álvaro Rodrigo Felisa Verdejo.
Third Recognizing Textual Entailment Challenge Potential SNeRG Submission.
Semantic distance in WordNet: An experimental, application-oriented evaluation of five measures Written by Alexander Budanitsky Graeme Hirst Retold by.
Article by: Feiyu Xu, Daniela Kurz, Jakub Piskorski, Sven Schmeier Article Summary by Mark Vickers.
Semantic Video Classification Based on Subtitles and Domain Terminologies Polyxeni Katsiouli, Vassileios Tsetsos, Stathes Hadjiefthymiades P ervasive C.
Copyright © Cengage Learning. All rights reserved.
Xiaomeng Su & Jon Atle Gulla Dept. of Computer and Information Science Norwegian University of Science and Technology Trondheim Norway June 2004 Semantic.
A Confidence Model for Syntactically-Motivated Entailment Proofs Asher Stern & Ido Dagan ISCOL June 2011, Israel 1.
Module 28 Sample Size Determination Reviewed 19 July 05/ Module 28 This module explores the process of estimating the sample size required for detecting.
Outline P1EDA’s simple features currently implemented –And their ablation test Features we have reviewed from Literature –(Let’s briefly visit them) –Iftene’s.
AQUAINT Kickoff Meeting – December 2001 Integrating Robust Semantics, Event Detection, Information Fusion, and Summarization for Multimedia Question Answering.
Slide Image Retrieval: A Preliminary Study Guo Min Liew and Min-Yen Kan National University of Singapore Web IR / NLP Group (WING)
Knowledge and Tree-Edits in Learnable Entailment Proofs Asher Stern and Ido Dagan (earlier partial version by Roy Bar-Haim) Download at:
A Grammar-based Entity Representation Framework for Data Cleaning Authors: Arvind Arasu Raghav Kaushik Presented by Rashmi Havaldar.
“How much context do you need?” An experiment about context size in Interactive Cross-language Question Answering B. Navarro, L. Moreno-Monteagudo, E.
Automatic Lexical Annotation Applied to the SCARLET Ontology Matcher Laura Po and Sonia Bergamaschi DII, University of Modena and Reggio Emilia, Italy.
Jiuling Zhang  Why perform query expansion?  WordNet based Word Sense Disambiguation WordNet Word Sense Disambiguation  Conceptual Query.
Jennie Ning Zheng Linda Melchor Ferhat Omur. Contents Introduction WordNet Application – WordNet Data Structure - WordNet FrameNet Application – FrameNet.
Mining and Analysis of Control Structure Variant Clones Guo Qiao.
Answer Validation Exercise - AVE QA subtrack at Cross-Language Evaluation Forum UNED (coord.) Anselmo Peñas Álvaro Rodrigo Valentín Sama Felisa Verdejo.
Annotating Words using WordNet Semantic Glosses Julian Szymański Department of Computer Systems Architecture, Faculty of Electronics, Telecommunications.
Definition of a taxonomy “System for naming and organizing things into groups that share similar characteristics” Taxonomy Architectures Applications.
10/22/2015ACM WIDM'20051 Semantic Similarity Methods in WordNet and Their Application to Information Retrieval on the Web Giannis Varelas Epimenidis Voutsakis.
ARTIFICIAL INTELLIGENCE [INTELLIGENT AGENTS PARADIGM] Professor Janis Grundspenkis Riga Technical University Faculty of Computer Science and Information.
1 Learning Sub-structures of Document Semantic Graphs for Document Summarization 1 Jure Leskovec, 1 Marko Grobelnik, 2 Natasa Milic-Frayling 1 Jozef Stefan.
Unsupervised Word Sense Disambiguation REU, Summer, 2009.
Semantics-Based News Recommendation with SF-IDF+ International Conference on Web Intelligence, Mining, and Semantics (WIMS 2013) June 13, 2013 Marnix Moerland.
1 Sentence Extraction-based Presentation Summarization Techniques and Evaluation Metrics Makoto Hirohata, Yousuke Shinnaka, Koji Iwano and Sadaoki Furui.
1/21 Automatic Discovery of Intentions in Text and its Application to Question Answering (ACL 2005 Student Research Workshop )
Methods for Automatic Evaluation of Sentence Extract Summaries * G.Ravindra +, N.Balakrishnan +, K.R.Ramakrishnan * Supercomputer Education & Research.
Department of Software and Computing Systems Research Group of Language Processing and Information Systems The DLSIUAES Team’s Participation in the TAC.
1 A Web Search Engine-Based Approach to Measure Semantic Similarity between Words Presenter: Guan-Yu Chen IEEE Trans. on Knowledge & Data Engineering,
1 Masters Thesis Presentation By Debotosh Dey AUTOMATIC CONSTRUCTION OF HASHTAGS HIERARCHIES UNIVERSITAT ROVIRA I VIRGILI Tarragona, June 2015 Supervised.
Variables It is very important in research to see variables, define them, and control or measure them.
Answer Mining by Combining Extraction Techniques with Abductive Reasoning Sanda Harabagiu, Dan Moldovan, Christine Clark, Mitchell Bowden, Jown Williams.
1 Measuring the Semantic Similarity of Texts Author : Courtney Corley and Rada Mihalcea Source : ACL-2005 Reporter : Yong-Xiang Chen.
Structured Text Retrieval Models. Str. Text Retrieval Text Retrieval retrieves documents based on index terms. Observation: Documents have implicit structure.
From Words to Senses: A Case Study of Subjectivity Recognition Author: Fangzhong Su & Katja Markert (University of Leeds, UK) Source: COLING 2008 Reporter:
SALSA-WS 09/05 Approximating Textual Entailment with LFG and FrameNet Frames Aljoscha Burchardt, Anette Frank Computational Linguistics Department Saarland.
Event-Based Extractive Summarization E. Filatova and V. Hatzivassiloglou Department of Computer Science Columbia University (ACL 2004)
NLP.
2/10/2016Semantic Similarity1 Semantic Similarity Methods in WordNet and Their Application to Information Retrieval on the Web Giannis Varelas Epimenidis.
Neural decoding of Visual Imagery during sleep PRESENTED BY: Sandesh Chopade Kaviti Sai Saurab T. Horikawa, M. Tamaki et al.
WordNet::Similarity Measuring the Relatedness of Concepts Yue Wang Department of Computer Science.
The GMAS Writing Rubric
Automatic Writing Evaluation
Automatically Extending NE coverage of Arabic WordNet using Wikipedia
Software Testing and Maintenance 1
Learning Textual Entailment from Examples
Mapping Ontology classes to Wordnet synsets
IOPS Toolkit for Risk-based Supervision
Automatic Detection of Causal Relations for Question Answering
Automatic Extraction of Hierarchical Relations from Text
Knowledge Representation for Natural Language Understanding
Giannis Varelas Epimenidis Voutsakis Paraskevi Raftopoulou
Chapter 10 Introduction to the Analysis of Variance
Presentation transcript:

1 RTE April 10, 2006 An approach based on Logic Forms and WordNet relationships to Textual Entailment performance O. Ferrández, R. M. Terol, R. Muñoz, P. Martínez-Barco and M. Palomar GPLSI – Natural Language Processing and Information Systems Group

2 Index System Architecture Derivation of the Logic Forms Computation of Similarity Measures between Logic Forms Result Analysis Conclusions and Future Work

3 Text Derivation of the Logic Forms System Architecture Hypothesis LF HypothesisLF Text Computation of similarity measures between Logic Forms Entailment? YESNO score

4 Derivation of the Logic Forms The Logic Forms are derived through an analysis of dependency relationships between the words of the sentence Employs a set of rules that infer several aspects such as the assert, its type, its identifier and the relationships between the different asserts in the logic form The Logic Forms are based on the logic form format defined in the eXtended WordNet

5 As an example “A shark attacked a human being” Dependency tree Logic Form shark:NN(x1) attack:VB(e1,x1,x3) human:NN(x2) NNC(x3,x2,x4) being:NN(x4) a:Det shark:N attack:V human:U being:N S det Lex-mod obj det a:Det Derivation of the Logic Forms

6 Computation of Similarity Measures between LF The method Focused on the entailment between the verbs (verbs generally govern the meaning of sentences) Firstly analyses the relation between the verbs of the two logic forms derived from the text and the hypothesis Secondly, if there is a relation between the verbs, then the method will analyse the similarity relations between all predicates which depending on the two verbs

7 simWeight = 0 Tvb = obtainVerbs(T) Hvb = obtainVerbs(H) for i = 0... size(Tvb) do for j = 0... size(Hvb) do if calcSim(Tvb(i),Hvb(j)) > 0 then simWeight += calcSim(Tvb(i),Hvb(j)) Telem = obtainElem(Tvb(i)) Helem = obtainElem(Hvb(j)) simWeight += calcSim(Telem,Helem) end if end for if simWeight > threshold then return TRUE else return FALSE end if Computation of Similarity Measures between LF

8 In order to obtain the similarity between the predicates of the logic forms (calcSim(x,y)), two approaches have been implemented Based on WordNet relations Based on Lin’s measure A Word Sense Disambiguation module was not employed The first 50% of the WordNet senses were taken into account The threshold, which determines if the text entails the hypothesis, has been obtained empirically using the development data Computation of Similarity Measures between LF

9 Based on WordNet relations For which concept (word#sense): Obtaining the relations among other concepts through the synsets Each relation has an associated weight Synonymy (0.9), Hypernymy (0.8), Hyponymy and Entailment (0.7), Meronymy and Holonymy (0.5) The length of the path that relates the two different concepts must be lower or equal than 4 synsets Computation of Similarity Measures between LF

10 Based on WordNet relations The weight of the path between two different concepts is calculated as the product of the weights associated to the relations connecting the intermediate synsets This weight indicates the relation between two concepts Computation of Similarity Measures between LF

11 Based on WordNet relations Example cable_car#n#3 subway#n#3  0.5*0.8*0.7=0.28 cable_car#n#1 railway#n#3 funicular#n#3 subway#n#3 holonymy Hypernymy Hyponymy Computation of Similarity Measures between LF

12 Based on Lin’s measure Lin’s similarity measure as implemented in WordNet::Similarity Open source software package Lin’s similarity measure augments the information content of the least common subsumer (LCS is the most specific concept that two concepts share as an ancestor) of the two concepts with the sum of the information content of the concepts Computation of Similarity Measures between LF

13 T: Five US soldiers were killed in the capital and insurgents blasted polling stations across the country kill:VB NNC five:NN NNC us:NN soldier:NN Ø in:IN capital:NN and:CC blast:VB insurgent:NN NNC polling:U... An example

14 H: Five US soldiers were killed kill:VB NNC five:NN NNC us:NNsoldier:NN Ø An example

15 kill#v kill#v  1 Verbs of H  killVerbs of T  kill, blast kill NNC five NNC us soldier Ø in capital and blast insurgents NNC polling... kill NNC five NNC ussoldier Ø Relation ~ 1 kill#v blast#v  0,34... Accumulating weights > Threshold  ENTAILMENT An example

16 Results (RTE2 dev&test) Run1 (Lin’s measure) Development data Accuracy: Test data Accuracy: Average Precision: Run2 (WN relations) Development data Accuracy: Test data Accuracy: Average Precision: Result Analysis

17 The empirical threshold of the development data A value of 0.24 Result Analysis

18 Conclusions and Future Work Our system derives the logic forms for the text/hypothesis pair and computes the similarity between them The similarity is computed using two different approaches: Lin’s similarity measure WordNet relation-based similarity Our system provides a score showing the semantic similarity between two logic forms

19 Conclusions and Future Work The run using Lin’s similarity measure achieves better results than the approach based onWordNet relations, both when tested on development, as well as test data This slight loss of accuracy is due to the fact that our WordNet relations approach attempts to establish an objective semantic comparison between the logic forms rather than an entailment relation

20 Conclusions and Future Work As a future work: Performing a deeper study about the most suitable WordNet relations for recognising textual entailment. Perhaps only hypernymy, synonymy and entailment relations between the text and the hypothesis would be more suitable for the entailment phenomenon Testing how other natural language processing tools can help in detecting textual entailment. For example, using a Named Entity Recognizer could help in detecting entailment between two segment of text

21 RTE April 10, 2006 Thank you very much O. Ferrández, R. M. Terol, R. Muñoz, P. Martínez-Barco and M. Palomar GPLSI – Natural Language Processing and Information Systems Group