Deciding entailment and contradiction with stochastic and edit distance-based alignment Marie-Catherine de Marneffe, Sebastian Pado, Bill MacCartney, Anna.

Slides:



Advertisements
Similar presentations
COGEX at the Second RTE Marta Tatu, Brandon Iles, John Slavick, Adrian Novischi, Dan Moldovan Language Computer Corporation April 10 th, 2006.
Advertisements

COGEX at the Second RTE Marta Tatu, Brandon Iles, John Slavick, Adrian Novischi, Dan Moldovan Language Computer Corporation April 10 th, 2006.
Recognizing Textual Entailment Challenge PASCAL Suleiman BaniHani.
Data Mining Methodology 1. Why have a Methodology  Don’t want to learn things that aren’t true May not represent any underlying reality ○ Spurious correlation.
Word Sense Disambiguation for Machine Translation Han-Bin Chen
Learning with Probabilistic Features for Improved Pipeline Models Razvan C. Bunescu Electrical Engineering and Computer Science Ohio University Athens,
Robust Textual Inference via Graph Matching Aria Haghighi Andrew Ng Christopher Manning.
Syntactic Contributions in the Entailment Task Lucy Vanderwende, Arul Menezes, Rion Snow (Stanford)
Normalized alignment of dependency trees for detecting textual entailment Erwin Marsi & Emiel Krahmer Tilburg University Wauter Bosma & Mariët Theune University.
Ang Sun Ralph Grishman Wei Xu Bonan Min November 15, 2011 TAC 2011 Workshop Gaithersburg, Maryland USA.
1 Learning to Detect Objects in Images via a Sparse, Part-Based Representation S. Agarwal, A. Awan and D. Roth IEEE Transactions on Pattern Analysis and.
A Phrase-Based Model of Alignment for Natural Language Inference Bill MacCartney, Michel Galley, and Christopher D. Manning Stanford University 26 October.
Learning to recognize features of valid textual inferences Bill MacCartney Stanford University with Trond Grenager, Marie-Catherine de Marneffe, Daniel.
Page-level Template Detection via Isotonic Smoothing Deepayan ChakrabartiYahoo! Research Ravi KumarYahoo! Research Kunal PuneraUniv. of Texas at Austin.
Automatic Classification of Semantic Relations between Facts and Opinions Koji Murakami, Eric Nichols, Junta Mizuno, Yotaro Watanabe, Hayato Goto, Megumi.
UNED at PASCAL RTE-2 Challenge IR&NLP Group at UNED nlp.uned.es Jesús Herrera Anselmo Peñas Álvaro Rodrigo Felisa Verdejo.
Student: Hsu-Yung Cheng Advisor: Jenq-Neng Hwang, Professor
Third Recognizing Textual Entailment Challenge Potential SNeRG Submission.
Feature-Rich Part-of-Speech Tagging with a Cyclic Dependency Network Kristina Toutanova, Dan Klein, Christopher Manning, Yoram Singer Stanford University.
Seven Lectures on Statistical Parsing Christopher Manning LSA Linguistic Institute 2007 LSA 354 Lecture 7.
Alignment based EDA Motivation: an EDA that fully utilizes EOP –EOP now provides various components with clearly separated LAP / CORE. –The platform is.
A Confidence Model for Syntactically-Motivated Entailment Proofs Asher Stern & Ido Dagan ISCOL June 2011, Israel 1.
An Information Theoretic Approach to Bilingual Word Clustering Manaal Faruqui & Chris Dyer Language Technologies Institute SCS, CMU.
SI485i : NLP Set 9 Advanced PCFGs Some slides from Chris Manning.
STRUCTURED PERCEPTRON Alice Lai and Shi Zhi. Presentation Outline Introduction to Structured Perceptron ILP-CRF Model Averaged Perceptron Latent Variable.
Longbiao Kang, Baotian Hu, Xiangping Wu, Qingcai Chen, and Yan He Intelligent Computing Research Center, School of Computer Science and Technology, Harbin.
A Global Relaxation Labeling Approach to Coreference Resolution Coling 2010 Emili Sapena, Llu´ıs Padr´o and Jordi Turmo TALP Research Center Universitat.
Page 1 Relation Alignment for Textual Entailment Recognition Department of Computer Science University of Illinois at Urbana-Champaign Mark Sammons, V.G.Vinod.
Outline P1EDA’s simple features currently implemented –And their ablation test Features we have reviewed from Literature –(Let’s briefly visit them) –Iftene’s.
Overview of the Fourth Recognising Textual Entailment Challenge NIST-Nov. 17, 2008TAC Danilo Giampiccolo (coordinator, CELCT) Hoa Trang Dan (NIST)
Knowledge and Tree-Edits in Learnable Entailment Proofs Asher Stern and Ido Dagan (earlier partial version by Roy Bar-Haim) Download at:
Empirical Methods in Information Extraction Claire Cardie Appeared in AI Magazine, 18:4, Summarized by Seong-Bae Park.
Knowledge and Tree-Edits in Learnable Entailment Proofs Asher Stern, Amnon Lotan, Shachar Mirkin, Eyal Shnarch, Lili Kotlerman, Jonathan Berant and Ido.
Active Learning for Statistical Phrase-based Machine Translation Gholamreza Haffari Joint work with: Maxim Roy, Anoop Sarkar Simon Fraser University NAACL.
Incident Threading for News Passages (CIKM 09) Speaker: Yi-lin,Hsu Advisor: Dr. Koh, Jia-ling. Date:2010/06/14.
This work is supported by the Intelligence Advanced Research Projects Activity (IARPA) via Department of Interior National Business Center contract number.
Combining terminology resources and statistical methods for entity recognition: an evaluation Angus Roberts, Robert Gaizauskas, Mark Hepple, Yikun Guo.
1 Using Semantic Dependencies to Mine Depressive Symptoms from Consultation Records Chung-Hsien Wu and Liang-Chih, Yu National Cheng Kung University Fong-Lin.
A Language Independent Method for Question Classification COLING 2004.
1 Learning Sub-structures of Document Semantic Graphs for Document Summarization 1 Jure Leskovec, 1 Marko Grobelnik, 2 Natasa Milic-Frayling 1 Jozef Stefan.
Indirect Supervision Protocols for Learning in Natural Language Processing II. Learning by Inventing Binary Labels This work is supported by DARPA funding.
Advisor: Hsin-His Chen Reporter: Chi-Hsin Yu Date: From ACL 2008, regular paper Marie-Catherine de Marneffe, Linguistics Department, Stanford.
Prototype-Driven Learning for Sequence Models Aria Haghighi and Dan Klein University of California Berkeley Slides prepared by Andrew Carlson for the Semi-
Non-Photorealistic Rendering and Content- Based Image Retrieval Yuan-Hao Lai Pacific Graphics (2003)
Cluster-specific Named Entity Transliteration Fei Huang HLT/EMNLP 2005.
Relation Alignment for Textual Entailment Recognition Cognitive Computation Group, University of Illinois Experimental ResultsTitle Mark Sammons, V.G.Vinod.
Hidden-Variable Models for Discriminative Reranking Jiawen, Liu Spoken Language Processing Lab, CSIE National Taiwan Normal University Reference: Hidden-Variable.
Inference Protocols for Coreference Resolution Kai-Wei Chang, Rajhans Samdani, Alla Rozovskaya, Nick Rizzolo, Mark Sammons, and Dan Roth This research.
Supertagging CMSC Natural Language Processing January 31, 2006.
4. Relationship Extraction Part 4 of Information Extraction Sunita Sarawagi 9/7/2012CS 652, Peter Lindes1.
1 Minimum Error Rate Training in Statistical Machine Translation Franz Josef Och Information Sciences Institute University of Southern California ACL 2003.
A New Approach for English- Chinese Named Entity Alignment Donghui Feng Yayuan Lv Ming Zhou USC MSR Asia EMNLP-04.
A Lightweight and High Performance Monolingual Word Aligner Xuchen Yao, Benjamin Van Durme, (Johns Hopkins) Chris Callison-Burch and Peter Clark (UPenn)
Finding document topics for improving topic segmentation Source: ACL2007 Authors: Olivier Ferret (18 route du Panorama, BP6) Reporter:Yong-Xiang Chen.
1 Measuring the Semantic Similarity of Texts Author : Courtney Corley and Rada Mihalcea Source : ACL-2005 Reporter : Yong-Xiang Chen.
Conditional Markov Models: MaxEnt Tagging and MEMMs
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)
Cheap and Fast – But is it Good? Evaluating Non-Expert Annotations for Natural Language Tasks EMNLP 2008 Rion Snow CS Stanford Brendan O’Connor Dolores.
Cell Segmentation in Microscopy Imagery Using a Bag of Local Bayesian Classifiers Zhaozheng Yin RI/CMU, Fall 2009.
Computational methods for inferring cellular networks II Stat 877 Apr 17 th, 2014 Sushmita Roy.
Concept-Based Analysis of Scientific Literature Chen-Tse Tsai, Gourab Kundu, Dan Roth UIUC.
Question Answering Passage Retrieval Using Dependency Relations (SIGIR 2005) (National University of Singapore) Hang Cui, Renxu Sun, Keya Li, Min-Yen Kan,
Short Text Similarity with Word Embedding Date: 2016/03/28 Author: Tom Kenter, Maarten de Rijke Source: CIKM’15 Advisor: Jia-Ling Koh Speaker: Chih-Hsuan.
Network Management Lecture 13. MACHINE LEARNING TECHNIQUES 2 Dr. Atiq Ahmed Université de Balouchistan.
Graph-based Dependency Parsing with Bidirectional LSTM Wenhui Wang and Baobao Chang Institute of Computational Linguistics, Peking University.
NYU Coreference CSCI-GA.2591 Ralph Grishman.
Bidirectional CRF for NER
A Structured Learning Approach to Temporal Relation Extraction
CS246: Information Retrieval
Presentation transcript:

Deciding entailment and contradiction with stochastic and edit distance-based alignment Marie-Catherine de Marneffe, Sebastian Pado, Bill MacCartney, Anna N. Rafferty, Eric Yeh and Christopher D. Manning NLP Group Stanford University

Three-stage architecture [MacCartney et al. NAACL 06] T: India buys missiles. H: India acquires arms.

Attempts to improve the different stages 1)Linguistic analysis: improving dependency graphs improving coreference 2)New alignment: edit distance-based alignment 3)Inference: entailment and contradiction

Stage I – Capturing long dependencies Maler realized the importance of publishing his investigations

Recovering long dependencies Training on dependency annotations in the WSJ segment of the Penn Treebank 3 MaxEnt classifiers: 1)Identify governor nodes that are likely to have a missing relationship 2) Identify the type of GR 3)Find the likeliest dependent (given GR and governor)

Some impact on RTE Cannot handle conjoined dependents: Pierre Curie and his wife realized the importance of advertising their discovery RTE results: AccuracyWith recovery RTE2 test RTE3 test RTE

Coreference with ILP Train pairwise classifier to make coreference decisions over pairs of mentions Use integer linear programming (ILP) to find best global solution Normally pairwise classifiers enforce transitivity in an ad-hoc manner ILP enforces transitivity by construction Candidates: all based-NP in the text and the hypothesis No difference in results compared to the OpenNLP coreference system [Finkel and Manning ACL 08]

Stage II – Previous stochastic aligner Word alignment scores: semantic similarity Edge alignment scores: structural similarity Linear model form: Perceptron learning of weights

Stochastic local search for alignments Complete state formulation Start with a (possibly bad) complete solution, and try to improve it At each step, select hypothesis word and generate all possible alignments Sample successor alignment from normalized distribution, and repeat

New aligner: MANLI 4 components: 1.Phrase-based representation 2.Feature-based scoring function 3.Decoding using simulated annealing 4.Perceptron learning on MSR RTE2 alignment data [MacCartney et al. EMNLP 08]

Phrase-based alignment representation DEL( In 1 ) … DEL( there 5 ) EQ( are 6, are 2 ) SUB( very 7 few 8, poorly 3 represented 4 ) EQ( women 9, women 1 ) EQ( in 10, in 5 ) EQ( parliament 11, parliament 6 ) An alignment is a sequence of phrase edits: EQ, SUB, DEL, INS 1-to-1 at phrase level but many-to-many at token level: avoids arbitrary alignment choices can use phrase-based resources

Score edits as linear combination of features, then sum: A feature-based scoring function Edit type features: EQ, SUB, DEL, INS Phrase features: phrase sizes, non-constituents Lexical similarity feature (max over similarity scores) WordNet, distributional similarity, string/lemma similarity Contextual features: distortion, matching neighbors

RTE4 results 2-way3-wayAv. P stochastic MANLI

Error analysis MANLI alignments are sparse -sure/possible alignments in MSR data - need more paraphrase information Difference between previous RTE data and RTE4: length ratio between text and hypothesis All else being equal, a longer text makes it likelier that a hypothesis can get over the threshold RTE1RTE3RTE4 T/H 2:13:14:1

Stage III – Contradiction detection 1.Linguistic analysis 2.Graph alignment 3.Contradiction features & classification tuned threshold contradicts doesn’t contradict score = = – T: A case of indigenously acquired rabies infection has been confirmed. H: No case of rabies was confirmed. case No rabies det prep_of –0.75 rabies POS NER IDF NNS … …… Feature fifi wiwi Polarity difference case No rabies det prep_of case A rabies det amod infection case A rabies det amod infection prep_of Event coreference [de Marneffe et al. ACL 08]

Event coreference is necessary for contradiction detection The contradiction features look for mismatching information between the text and hypothesis Problematic if the two sentences do not describe the same event T: More than 2,000 people lost their lives in the devastating Johnstown Flood. H: 100 or more people lost their lives in a ferry sinking. Mismatching information: more than 2,000 != 100 or more

Contradiction features RTEContradiction Polarity Number, date and time Antonymy Structure Factivity Modality Relations Alignment AdjectiveGradation, Hypernymy Adjunct more precisely defined

Contradiction & Entailment Both systems are run independently Trust entailment system more RTE system yes ENTAIL no Contradiction system yesno UNKNOWNNO

Contradiction results Low recall - 47 contradictions filtered out by the “event” filter - 3 contradictions tagged as entailment - contradictions requiring deep lexical knowledge precisionrecall submission:alone combined post hoc:with filter without filter

Deep lexical knowledge T: … Power shortages are a thing of the past. H: Nigeria power shortage is to persist. T: … No children were among the victims. H: A French train crash killed children. T: … The report of a crash was a false alarm. H: A plane crashes in Italy. T: … The current food crisis was ignored. H: UN summit targets global food crisis.

Precision errors Hard to find contradiction features that reach high accuracy % error Bad alignment23 Coreference6 Structure40 Antonymy10 Negation10 Relations6 Numeric3

More knowledge is necessary T: The company affected by this ban, Flour Mills of Fiji, exports nearly US$900,000 worth of biscuits to Vanuatu yearly. H: Vanuatu imports biscuits from Fiji. T: The Concord crashed […], killing all 109 people on board and four workers on the ground. H: The crash killed 113 people.

Conclusion Linguistic analysis: some gain when improving dependency graphs Alignment: potential in phrase-based representation not yet proven: need better phrase-based lexical resources Inference: can detect some contradictions, but need to improve precision & add knowledge for higher recall